167
click to vote
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
Shape completion is an intriguing problem in geometry processing with applications in CAD and graphics. This paper defines a new type of 3D curves, which can be utilized for curv...
220
click to vote
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing ...
172
click to vote
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
99
Voted
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
89
Voted
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
