COMGEO
2007
ACM
13 years 4 months ago
2007
ACM
Given two points on a closed planar curve, C, we can divide the length of a shortest connecting path in C by their Euclidean distance. The supremum of these ratios, taken over all...
COMGEO
2007
ACM
13 years 4 months ago
2007
ACM
We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given...
COMGEO
2007
ACM
13 years 4 months ago
2007
ACM
Recent results establish that a subset of the Voronoi diagram of a point set that is sampled from the smooth boundary of a shape approximates the medial axis. The corresponding qu...
COMGEO
2007
ACM
13 years 4 months ago
2007
ACM
COMGEO
2007
ACM
13 years 4 months ago
2007
ACM
A new algorithm is presented for surface reconstruction from unorganized points. Unlike many previous algorithms, this algorithm does not select a subcomplex of the Delaunay Trian...