COMPGEOM 2010 | Sciweavers

47

COMPGEOM
2010
ACM

236views Discrete Geometry» more COMPGEOM 2010»

3D Euler spirals for 3D curve completion

14 years 4 months ago

Shape completion is an intriguing problem in geometry processing with applications in CAD and graphics. This paper deﬁnes a new type of 3D curves, which can be utilized for curv...

Gur Harary, Ayellet Tal

claim paper

Read More »

63

click to vote

COMPGEOM
2010
ACM

235views Discrete Geometry» more COMPGEOM 2010»

Constructing Reeb graphs using cylinder maps

14 years 4 months ago

Download drona.csa.iisc.ernet.in

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

claim paper

Read More »

39

click to vote

COMPGEOM
2010
ACM

215views Discrete Geometry» more COMPGEOM 2010»

Adding one edge to planar graphs makes crossing number hard

14 years 4 months ago

Download www.fmf.uni-lj.si

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

claim paper

Read More »

26

click to vote

COMPGEOM
2010
ACM

121views Discrete Geometry» more COMPGEOM 2010»

Tight lower bounds for halfspace range searching

14 years 4 months ago