1879 search results - page 218 / 376 » Computational geometry algorithms library |
145
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
Let P be a simple polygon with m vertices, k of which are reflex, and which contains r red points and b blue points in its interior. Let n = m + r + b. A ham-sandwich geodesic is ...
186
click to vote
PCM
2004
Springer
15 years 10 months ago
2004
Springer
The layered depth image (LDI) is a popular approach to represent three-dimensional objects with complex geometry for image-based rendering (IBR). LDI contains several attribute val...
167
click to vote
COMPGEOM
2003
ACM
15 years 10 months ago
2003
ACM
We consider two variants of the well-known “sailor in the fog” puzzle. The first version (the “asteroid surveying” problem) is set in three dimensions and asks for the sh...
153
Voted
COMPGEOM
2003
ACM
15 years 10 months ago
2003
ACM
Given a Morse function over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight u...
250
click to vote
VISUALIZATION
2002
IEEE
15 years 10 months ago
2002
IEEE
In this paper we introduce, analyze and quantitatively compare a number of surface simplification methods for point-sampled geometry. We have implemented incremental and hierarchi...