140 search results - page 4 / 28 » Computing the visibility graph of points within a polygon |
COMGEO
2006
ACM
13 years 5 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
COMPGEOM
1993
ACM
13 years 10 months ago
1993
ACM
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
ISVC
2009
Springer
13 years 10 months ago
2009
Springer
The reconstruction of 3D objects from a point-cloud is based on sufficient separation of the points representing objects of interest from the points of other, unwanted objects. Thi...
ENC
2004
IEEE
13 years 9 months ago
2004
IEEE
Point hierarchies are suitable for creating framecoherent animations of 3D models in non-photorealistic styles such as stippling, painterly and other artistic rendering. In this p...
CCCG
2007
13 years 7 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...