COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
Given a set H of n hyperplanes in IRd , we present an algorithm that ε-approximates the extent between the top and bottom k levels of the arrangement of H in time O(n+(k/ε)c), w...
COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
Let P be a set of n points in Rd. The radius of a k-dimensional flat F with respect to P, denoted by RD(F, P), is defined to be maxp∈P dist(F, p), where dist(F, p) denotes the...
COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
Given a collection C of circles in the plane, we wish to construct the arrangement A(C) (namely the subdivision of the plane into vertices, edges and faces induced by C) using fl...
COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than π). In this paper we prove that the ...
COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
We define the Morse-Smale complex of a Morse function over a 3-manifold as the overlay of the descending and ascending manifolds of all critical points. In the generic case, its ...
COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
We introduce billboard clouds – a new approach for extreme simplification in the context of real-time rendering. 3D models are simplified onto a set of planes with texture and...