3025 search results - page 243 / 605 » Computational geometry: a retrospective |
208
click to vote
SIGGRAPH
1996
ACM
15 years 10 months ago
1996
ACM
We present a new method that utilizes path coherence to accelerate walkthroughs of geometrically complex static scenes. As a preprocessing step, our method constructs a BSP-tree t...
180
click to vote
COMPGEOM
1994
ACM
15 years 10 months ago
1994
ACM
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
185
click to vote
COMPGEOM
1995
ACM
15 years 10 months ago
1995
ACM
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
170
click to vote
SMA
2010
ACM
15 years 6 months ago
2010
ACM
In region machining, neighbouring regions may be close together, but disconnected. Boundary curves may also have unwanted geometric artifacts caused by approximation and discretis...
169
click to vote
SMA
2008
ACM
15 years 6 months ago
2008
ACM
Quadrangular remeshing of triangulated surfaces has received an increasing attention in recent years. A particularly elegant approach is the extraction of quads from the streamlin...