129
click to vote
COMPGEOM
15 years 6 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...
163
click to vote
COMPGEOM
15 years 6 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 ...
146
click to vote
COMPGEOM
15 years 6 months ago
2010 ACM 
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
133
click to vote
COMPGEOM
15 years 6 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 ...
164
click to vote
COMPGEOM
15 years 6 months ago
2010 ACM 
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
|
Discrete Geometry