Sciweavers

COMPGEOM
2010
ACM
13 years 8 months ago
3D Euler spirals for 3D curve completion
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...
Gur Harary, Ayellet Tal
COMPGEOM
2010
ACM
13 years 8 months ago
Constructing Reeb graphs using cylinder maps
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 ...
Harish Doraiswamy, Aneesh Sood, Vijay Natarajan
COMPGEOM
2010
ACM
13 years 8 months ago
Adding one edge to planar graphs makes crossing number hard
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 ...
Sergio Cabello, Bojan Mohar
COMPGEOM
2010
ACM
13 years 8 months ago
Tight lower bounds for halfspace range searching
Sunil Arya, David M. Mount, Jian Xia