Sciweavers

COMPGEOM
2005
ACM
14 years 1 months ago
The Visibility-Voronoi Complex and Its Applications
We introduce a new type of diagram called the VV(c)-diagram (the visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diag...
Ron Wein, Jur P. van den Berg, Dan Halperin
COMPGEOM
2005
ACM
14 years 1 months ago
Star splaying: an algorithm for repairing delaunay triangulations and convex hulls
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
Jonathan Richard Shewchuk
COMPGEOM
2005
ACM
14 years 1 months ago
On the exact computation of the topology of real algebraic curves
We consider the problem of computing a representation of the plane graph induced by one (or more) algebraic curves in the real plane. We make no assumptions about the curves, in p...
Raimund Seidel, Nicola Wolpert
COMPGEOM
2005
ACM
14 years 1 months ago
Fast construction of nets in low dimensional metrics, and their applications
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
Sariel Har-Peled, Manor Mendel
COMPGEOM
2005
ACM
14 years 1 months ago
Smaller coresets for k-median and k-means clustering
In this paper, we show that there exists a (k, ε)-coreset for k-median and k-means clustering of n points in IRd , which is of size independent of n. In particular, we construct ...
Sariel Har-Peled, Akash Kushal
COMPGEOM
2005
ACM
14 years 1 months ago
Animation of curve constrained drawings of planar graphs
Ï ×Ù ÑØ Ò ÒÑ ØÓÒ Ó Ò Ð ÓÖØ Ñ ÓÖ Ö ÛÒ Ò Ö ØÖ ÖÝÔÐ Ò Ö Ö Ô ÛØ Ú ÖØ ×ÐÓ Ø ÓÒ × Ñ¹ Ö Ð Ò × Ö ÛÒ × ×ØÖ Ø ÐÒ × Ñ ÒØ×...
Kim Hansen, Stephen K. Wismath
COMPGEOM
2005
ACM
14 years 1 months ago
Exact Minkowski sums of convex polyhedra
Efi Fogel, Dan Halperin
COMPGEOM
2005
ACM
14 years 1 months ago
Finding the best shortcut in a geometric network
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
Mohammad Farshi, Panos Giannopoulos, Joachim Gudmu...
COMPGEOM
2005
ACM
14 years 1 months ago
Dynamic maintenance of molecular surfaces under conformational changes
We present an efficient algorithm for maintaining the boundary and surface area of protein molecules as they undergo conformational changes. We also describe a robust implementati...
Eran Eyal, Dan Halperin
COMPGEOM
2005
ACM
14 years 1 months ago
Minimum dilation stars
David Eppstein, Kevin A. Wortman