COMPGEOM
2004
ACM
14 years 3 months ago
2004
ACM
We introduce a new approach to the problem of collision detection between a rotating milling-cutter of an NC-machine and a model of a solid workpiece, as the rotating cutter conti...
COMPGEOM
2004
ACM
14 years 3 months ago
2004
ACM
We present the first complete, exact, and efficient C++ implementation for parameterizing the intersection of two implicit quadrics with integer coefficients of arbitrary size. It...
COMPGEOM
2004
ACM
14 years 3 months ago
2004
ACM
The Bentley-Ottmann sweep-line method can be used to compute the arrangement of planar curves provided a number of geometric primitives operating on the curves are available. We d...
COMPGEOM
2004
ACM
14 years 3 months ago
2004
ACM
We propose a new algorithm for constructing finite-element meshes suitable for spacetime discontinuous Galerkin solutions of linear hyperbolic PDEs. Given a triangular mesh of som...
COMPGEOM
2004
ACM
14 years 4 months ago
2004
ACM
We show that the persistent homology of a filtered ddimensional simplicial complex is simply the standard homology of a particular graded module over a polynomial ring. Our analy...
COMPGEOM
2004
ACM
14 years 4 months ago
2004
ACM
COMPGEOM
2004
ACM
14 years 4 months ago
2004
ACM
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
COMPGEOM
2004
ACM
14 years 4 months ago
2004
ACM
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
COMPGEOM
2004
ACM
14 years 4 months ago
2004
ACM
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...
COMPGEOM
2004
ACM
14 years 4 months ago
2004
ACM
Let P be a set of n points in Ê3 , not all in a common plane. We solve a problem of Scott (1970) by showing that the connecting lines of P assume at least 2n − 7 different dir...