140 search results - page 5 / 28 » Computing the visibility graph of points within a polygon |
111
click to vote
SIGGRAPH
1993
ACM
15 years 3 months ago
1993
ACM
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
109
click to vote
COMPGEOM
2005
ACM
15 years 1 months ago
2005
ACM
We introduce a new type of diagram called the VV(c)-diagram (the visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diag...
COMPGEOM
1991
ACM
15 years 3 months ago
1991
ACM
Given a simple polygon in the plane with two distinguished vertices, s and g, is it possible for two guards to simultaneously walk along the two boundary chains from s to g in suc...
IROS
2006
IEEE
15 years 5 months ago
2006
IEEE
— This paper formalizes and proposes an algorithm to compute coverage diameters of polygons in 2D. Roughly speaking, the coverage diameter of a polygon is the longest possible di...
CGI
2004
IEEE
15 years 3 months ago
2004
IEEE
In this paper, we propose a new method that can consistently orient all normals of any mesh (if at all possible), while ensuring that most polygons are seen with their front-faces...