Sciweavers

COMPGEOM
2008
ACM
14 years 19 days ago
Self-improving algorithms for delaunay triangulations
We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n points of the input each come from an independent, ...
Kenneth L. Clarkson, C. Seshadhri
COMPGEOM
2008
ACM
14 years 19 days ago
Embedding and similarity search for point sets under translation
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...
Minkyoung Cho, David M. Mount
COMPGEOM
2008
ACM
14 years 19 days ago
Visualizing and exploring planar algebraic arrangements: a web application
A web application is presented to compute, plot, and interactively explore planar arrangements induced by algebraic plane curves of arbitrary degree. It produces accurate curve pl...
Pavel Emeliyanenko, Michael Kerber
COMPGEOM
2008
ACM
14 years 19 days ago
External memory planar point location with logarithmic updates
Lars Arge, Gerth Stølting Brodal, S. Sriniv...
COMPGEOM
2008
ACM
14 years 19 days ago
Exact geometric-topological analysis of algebraic surfaces
We present a method to compute the exact topology of a real algebraic surface S, implicitly given by a polynomial f
Eric Berberich, Michael Kerber, Michael Sagraloff
COMPGEOM
2008
ACM
14 years 19 days ago
Towards persistence-based reconstruction in euclidean spaces
Manifold reconstruction has been extensively studied for the last decade or so, especially in two and three dimensions. Recent advances in higher dimensions have led to new method...
Frédéric Chazal, Steve Oudot
COMPGEOM
2008
ACM
14 years 19 days ago
Predicates for line transversals to lines and line segments in three-dimensional space
When an observer is in a 3D scene, a topological change in the view arises when the line of sight is tangent to four objects. If we consider polyhedral scenes, the relevant lines ...
Olivier Devillers, Marc Glisse, Sylvain Lazard
COMPGEOM
2008
ACM
14 years 19 days ago
Circular partitions with applications to visualization and embeddings
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
Krzysztof Onak, Anastasios Sidiropoulos
COMPGEOM
2008
ACM
14 years 19 days ago
Extremal problems on triangle areas in two and three dimensions
The study of extremal problems on triangle areas was initiated in a series of papers by Erdos and Purdy in the early 1970s. In this paper we present new results on such problems, ...
Adrian Dumitrescu, Micha Sharir, Csaba D. Tó...
COMPGEOM
2008
ACM
14 years 19 days ago
Maximum thick paths in static and dynamic environments
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...