COMPGEOM
2010
ACM
14 years 4 months ago
2010
ACM
We characterize the set of all pairs (a, b) such that for every set P of n points in general position in R2 there always exists a point p ∈ P and two opposite quadrants determin...
COMPGEOM
2010
ACM
14 years 4 months ago
2010
ACM
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
COMPGEOM
2010
ACM
14 years 4 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
COMPGEOM
2010
ACM
14 years 4 months ago
2010
ACM
We introduce a novel and general approach for digitalization of line segments in the plane that satisfies a set of axioms naturally arising from Euclidean axioms. In particular, ...
COMPGEOM
2010
ACM
14 years 4 months ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
COMPGEOM
2010
ACM
14 years 4 months ago
2010
ACM
We present two new fundamental lower bounds on the worst-case combinatorial complexity of sets of free lines and sets of maximal free line segments in the presence of balls in thr...
COMPGEOM
2010
ACM
14 years 4 months ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
COMPGEOM
2010
ACM
14 years 4 months ago
2010
ACM
This video describes a new type of 3D curves, which generalizes the family of 2D Euler spirals. They are defined as the curves having both their curvature and their torsion evolv...
COMPGEOM
2010
ACM
14 years 4 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
COMPGEOM
2010
ACM
14 years 4 months ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...