Results 1 to 10 of about 4,255,094 (265)
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
Flip Distance Between Triangulations of a Simple Polygon is NP-Complete [PDF]
Discrete & Computational Geometry, 2015 Let T be a triangulation of a simple polygon. A flip in T is the operation of replacing one diagonal of T by a different one such that the resulting graph is again a triangulation.
O. Aichholzer +2 more
semanticscholar +4 more sources
Shortest path in a polygon using sublinear space [PDF]
Journal of Computational Geometry, 2015 We resolve an open problem due to Tetsuo Asano, showing how to compute the shortest path in a polygon, given in a read only memory, using sublinear space and subquadratic time.
Sariel Har-Peled
doaj +5 more sources
Weak Visibility Queries of Line Segments in Simple Polygons [PDF]
, 2012 Given a simple polygon P in the plane, we present new algorithms and data structures for computing the weak visibility polygon from any query line segment in P. We build a data structure in O(n) time and O(n) space that can compute the visibility polygon
Danny Z. Chen, Haitao Wang
openalex +4 more sources
Memory-constrained algorithms for simple polygons [PDF]
Computational Geometry, 2013 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. We show that we can find a triangulation of a plane straight-line graph in $O(n^2)$ time. We also consider
Wolfgang Mulzer +6 more
openaire +12 more sources
Geodesic Fréchet distance inside a simple polygon [PDF]
TALG, 2008 We present an alternative to parametric search that applies to both the nongeodesic and geodesic Fréchet optimization problems. This randomized approach is based on a variant of red-blue intersections and is appealing due to its elegance and practical ...
Atlas F. Cook, C. Wenk
semanticscholar +3 more sources
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
Forms of Crossed and Simple Polygons
Science & Philosophy, 2019 In this paper the author presents a new form of hexagon and the solution of the open problem of classifying plane hexagons. In particular are illustrated the forms of crossed and simple n-gons for n = 3, 4, 5, 6 and also the forms of simple ones for n ...
Luigi Togliani
doaj +3 more sources
Kinetic collision detection for simple polygons [PDF]
International Journal of Computational Geometry & Applications, 2000 We design a simple and elegant kinetic data structure for detecting collisions between polygonal (but not necessarily convex) objects in motion in the plane. Our structure is compact, maintaining an active set of certificates whose number is proportional to a minimum-size set of separating polygons for the objects.
David Kirkpatrick +2 more
+7 more sources
Gauss Digitization of Simple Polygons
, 2021 Digitization is a process of discretizing a continuous object $X ⊂ R 2$ to obtain a digital object $X ⊂ Z 2$. This document addresses the Gauss digitization of continuous objects. In particular, we are interested in computing the digitized object of simple polygons.
Phuc Ngo
openalex +4 more sources