140 search results - page 10 / 28 » Computing the visibility graph of points within a polygon |
102
click to vote
WALCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
193
Voted
VR
2011
IEEE
14 years 3 months ago
2011
IEEE
We introduce a general technique for blending imagery from multiple projectors on a tracked, moving, non-planar object. Our technique continuously computes visibility of pixels ov...
115
Voted
CMIG
2011
14 years 3 months ago
2011
In this paper, a method is described to automatically estimate the visible body region of a computed tomography (CT) volume image. In order to quantify the body region, a body coo...
EUROGRAPHICS
2010
Eurographics
15 years 8 months ago
2010
Eurographics
We present a new technique to implement operators that modify the topology of polygonal meshes at intersections and self-intersections. Depending on the modification strategy, th...
107
Voted
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...