Guard placement for efficient pointin-polygon proofs

{eppstein, goodrich, nodari} (at) ics.uci.edu We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard views an infinite wedge of the plane, and a point can prove membership in P if it is inside the wedges for a set of guards whose common intersection contains no points outside the polygon. This model leads to a broad class of new art gallery type problems, which we call “sculpture garden ” problems and for which we provide upper and lower bounds. In particular, we show there is a polygon P such that a “natural” angle-guard vertex placement cannot fully distinguish between points on the inside and outside of P (even if we place a guard at every vertex of P), which implies that Steinerpoint guards are sometimes necessary. More generally, we show that, for any polygon P, there is a set of n + 2(h − 1) angle guards that solve the sculpture garden problem for P, where h is the number of holes in P (so a simple polygon can be defined with n − 2 guards). In addition, we show that, for any orthogonal polygon P, the sculpture garden problem can be solved using n angle guards. We also give an 2 example of a class of simple (non-general-position) polygons that have sculpture garden solutions using O ( √ n) guards, and we show this bound is optimal to within a constant factor. Finally, while optimizing the number of guards solving a sculpture garden problem for a particular P is of unknown complexity, we show how to find in polynomial time a guard placement whose size is within a factor of 2 of the optimal number for any particular polygon

Sparse Volumetric Deformation

Volume rendering is becoming increasingly popular as applications require realistic solid shape representations with seamless texture mapping and accurate filtering. However rendering sparse volumetric data is difficult because of the limited memory and processing capabilities of current hardware. To address these limitations, the volumetric information can be stored at progressive resolutions in the hierarchical branches of a tree structure, and sampled according to the region of interest. This means that only a partial region of the full dataset is processed, and therefore massive volumetric scenes can be rendered efficiently. The problem with this approach is that it currently only supports static scenes. This is because it is difficult to accurately deform massive amounts of volume elements and reconstruct the scene hierarchy in real-time. Another problem is that deformation operations distort the shape where more than one volume element tries to occupy the same location, and similarly gaps occur where deformation stretches the elements further than one discrete location. It is also challenging to efficiently support sophisticated deformations at hierarchical resolutions, such as character skinning or physically based animation. These types of deformation are expensive and require a control structure (for example a cage or skeleton) that maps to a set of features to accelerate the deformation process. The problems with this technique are that the varying volume hierarchy reflects different feature sizes, and manipulating the features at the original resolution is too expensive; therefore the control structure must also hierarchically capture features according to the varying volumetric resolution. This thesis investigates the area of deforming and rendering massive amounts of dynamic volumetric content. The proposed approach efficiently deforms hierarchical volume elements without introducing artifacts and supports both ray casting and rasterization renderers. This enables light transport to be modeled both accurately and efficiently with applications in the fields of real-time rendering and computer animation. Sophisticated volumetric deformation, including character animation, is also supported in real-time. This is achieved by automatically generating a control skeleton which is mapped to the varying feature resolution of the volume hierarchy. The output deformations are demonstrated in massive dynamic volumetric scenes

LIPIcs, Volume 258, SoCG 2023, Complete Volume

LIPIcs, Volume 258, SoCG 2023, Complete Volum

Minkowski Sum Construction and other Applications of Arrangements of Geodesic Arcs on the Sphere

We present two exact implementations of efficient output-sensitive algorithms that compute Minkowski sums of two convex polyhedra in 3D. We do not assume general position. Namely, we handle degenerate input, and produce exact results. We provide a tight bound on the exact maximum complexity of Minkowski sums of polytopes in 3D in terms of the number of facets of the summand polytopes. The algorithms employ variants of a data structure that represents arrangements embedded on two-dimensional parametric surfaces in 3D, and they make use of many operations applied to arrangements in these representations. We have developed software components that support the arrangement data-structure variants and the operations applied to them. These software components are generic, as they can be instantiated with any number type. However, our algorithms require only (exact) rational arithmetic. These software components together with exact rational-arithmetic enable a robust, efficient, and elegant implementation of the Minkowski-sum constructions and the related applications. These software components are provided through a package of the Computational Geometry Algorithm Library (CGAL) called Arrangement_on_surface_2. We also present exact implementations of other applications that exploit arrangements of arcs of great circles embedded on the sphere. We use them as basic blocks in an exact implementation of an efficient algorithm that partitions an assembly of polyhedra in 3D with two hands using infinite translations. This application distinctly shows the importance of exact computation, as imprecise computation might result with dismissal of valid partitioning-motions.Comment: A Ph.D. thesis carried out at the Tel-Aviv university. 134 pages long. The advisor was Prof. Dan Halperi

KINE[SIS]TEM'17 From Nature to Architectural Matter

Kine[SiS]tem – From Kinesis + System. Kinesis is a non-linear movement or activity of an organism in response to a stimulus. A system is a set of interacting and interdependent agents forming a complex whole, delineated by its spatial and temporal boundaries, influenced by its environment. How can architectural systems moderate the external environment to enhance comfort conditions in a simple, sustainable and smart way? This is the starting question for the Kine[SiS]tem’17 – From Nature to Architectural Matter International Conference. For decades, architectural design was developed despite (and not with) the climate, based on mechanical heating and cooling. Today, the argument for net zero energy buildings needs very effective strategies to reduce energy requirements. The challenge ahead requires design processes that are built upon consolidated knowledge, make use of advanced technologies and are inspired by nature. These design processes should lead to responsive smart systems that deliver the best performance in each specific design scenario. To control solar radiation is one key factor in low-energy thermal comfort. Computational-controlled sensor-based kinetic surfaces are one of the possible answers to control solar energy in an effective way, within the scope of contradictory objectives throughout the year.FC

The benefits of an additional practice in descriptive geomerty course: non obligatory workshop at the Faculty of Civil Engineering in Belgrade

At the Faculty of Civil Engineering in Belgrade, in the Descriptive geometry (DG) course, non-obligatory workshops named “facultative task” are held for the three generations of freshman students with the aim to give students the opportunity to get higher final grade on the exam. The content of this workshop was a creative task, performed by a group of three students, offering free choice of a topic, i.e. the geometric structure associated with some real or imagery architectural/art-work object. After the workshops a questionnaire (composed by the professors at the course) is given to the students, in order to get their response on teaching/learning materials for the DG course and the workshop. During the workshop students performed one of the common tests for testing spatial abilities, named “paper folding". Based on the results of the questionnairethe investigation of the linkages between:students’ final achievements and spatial abilities, as well as students’ expectations of their performance on the exam, and how the students’ capacity to correctly estimate their grades were associated with expected and final grades, is provided. The goal was to give an evidence that a creative work, performed by a small group of students and self-assessment of their performances are a good way of helping students to maintain motivation and to accomplish their achievement. The final conclusion is addressed to the benefits of additional workshops employment in the course, which confirmhigherfinal scores-grades, achievement of creative results (facultative tasks) and confirmation of DG knowledge adaption

The contemporary visualization and modelling technologies and the techniques for the design of the green roofs

The contemporary design solutions are merging the boundaries between real and virtual world. The Landscape architecture like the other interdisciplinary field stepped in a contemporary technologies area focused on that, beside the good execution of works, designer solutions has to be more realistic and “touchable”. The opportunities provided by Virtual Reality are certainly not negligible, it is common knowledge that the designs in the world are already presented in this way so the Virtual Reality increasingly used. Following the example of the application of virtual reality in landscape architecture, this paper deals with proposals for the use of virtual reality in landscape architecture so that designers, clients and users would have a virtual sense of scope e.g. rooftop garden, urban areas, parks, roads, etc. It is a programming language that creates a series of images creating a whole, so certain parts can be controlled or even modified in VR. Virtual reality today requires a specific gadget, such as Occulus, HTC Vive, Samsung Gear VR and similar. The aim of this paper is to acquire new theoretical and practical knowledge in the interdisciplinary field of virtual reality, the ability to display using virtual reality methods, and to present through a brief overview the plant species used in the design and construction of an intensive roof garden in a Mediterranean climate, the basic characteristics of roofing gardens as well as the benefits they carry. Virtual and augmented reality as technology is a very powerful tool for landscape architects, when modeling roof gardens, parks, and urban areas. One of the most popular technologies used by landscape architects is Google Tilt Brush, which enables fast modeling. The Google Tilt Brush VR app allows modeling in three-dimensional virtual space using a palette to work with the use of a three dimensional brush. The terms of two "programmed" realities - virtual reality and augmented reality - are often confused. One thing they have in common, though, is VRML - Virtual Reality Modeling Language. In this paper are shown the ways on which this issue can be solved and by the way, get closer the term of Virtual Reality (VR), also all the opportunities which the Virtual reality offered us. As well, in this paper are shown the conditions of Mediterranean climate, the conceptual solution and the plant species which will be used by execution of intensive green roof on the motel “Marković”