Results 11 to 20 of about 4,303,118 (363)
Polygon Laplacian Made Simple [PDF]
Computer Graphics Forum, 2020 The discrete Laplace‐Beltrami operator for surface meshes is a fundamental building block for many (if not most) geometry processing algorithms. While Laplacians on triangle meshes have been researched intensively, yielding the cotangent discretization ...
A. Bunge +3 more
semanticscholar +4 more sources
Memory-Constrained Algorithms for Simple Polygons [PDF]
Computational Geometry, 2011 A constant-workspace algorithm has read-only access to an input array and may use only O(1) additional words of $O(\log n)$ bits, where $n$ is the size of the input. We assume that a simple $n$-gon is given by the ordered sequence of its vertices.
André Schulz +34 more
core +11 more sources
Diffuse Reflection Diameter in Simple Polygons [PDF]
Discrete Applied Mathematics, 2015 We prove a conjecture of Aanjaneya, Bishnu, and Pal that the minimum number of diffuse reflections sufficient to illuminate the interior of any simple polygon with $n$ walls from any interior point light source is $\lfloor n/2 \rfloor - 1$.
Arkin +13 more
core +3 more sources
On the number of visibility graphs of simple polygons
Discrete Mathematics, 2001 A visibility graph of order \(n\) is what can be seen as the graph obtained from an \(n\)-gon on the plane by adding all the edges each represented by the straight segment between the two ends (vertices of the \(n\)-gon) in the inner domain of the \(n\)-gon. It is asked how many distinct labeled graphs of order \(n\) are visibility graphs.
Ferrán Hurtado, Marc Noy
openalex +4 more sources
Dynamic Algorithms for Visibility Polygons in Simple Polygons [PDF]
International Journal of Computational Geometry & Applications, 2020 We devise the following dynamic algorithms for both maintaining as well as querying for the visibility and weak visibility polygons amid vertex insertions and deletions to the simple polygon. A fully-dynamic algorithm for maintaining the visibility polygon of a fixed point located interior to the simple polygon amid vertex insertions and deletions to
R. Inkulu, K. Sowmya, Nitish P. Thakur
openaire +3 more sources
An efficient algorithm for finding the CSG representation of a simple polygon [PDF]
International Conference on Computer Graphics and Interactive Techniques, 1988 David Dobkin +3 more
openalex +2 more sources
Sustainability, 2021 Precipitation is a crucial component of the water cycle, and its unpredictability may dramatically influence agriculture, ecosystems, and water resource management.
M. Achite +4 more
semanticscholar +1 more source
Computing a Geodesic Two-Center of Points in a Simple Polygon [PDF]
Latin American Symposium on Theoretical Informatics, 2016 Given a simple polygon P and a set Q of points contained in P, we consider the geodesic k-center problem in which we seek to find k points, called centers, in P to minimize the maximum geodesic distance of any point of Q to its closest center.
Eunjin Oh, S. Bae, Hee-Kap Ahn
semanticscholar +1 more source
Diffuse Reflections in Simple Polygons [PDF]
Electronic Notes in Discrete Mathematics, 2013 Abstract We prove a conjecture of Aanjaneya, Bishnu, and Pal that the maximum number of diffuse reflections needed for a point light source to illuminate the interior of a simple polygon with n walls is ⌊ n / 2 ⌋ − 1 . Light reflecting diffusely leaves a surface in all directions, rather than at an identical angle as with specular ...
Gill Barequet +6 more
openalex +3 more sources
Recognizing Weakly Simple Polygons [PDF]
Discrete & Computational Geometry, 2017 35 pages, 28 figures. A 15-page extended abstract has appeared in the Proceeding of the 32nd International Symposium on Computational Geometry (Boston, MA, 2016)
Akitaya, Hugo A. +3 more
openaire +5 more sources