COMPGEOM
1996
ACM
13 years 11 months ago
1996
ACM
COMPGEOM
1996
ACM
13 years 11 months ago
1996
ACM
Given a simple arrangementof n pseudolines in the Euclidean plane, associate with line i the list i of the lines crossing i in the order of the crossings on line i. i = ( i 1; i 2;...
COMPGEOM
1996
ACM
13 years 11 months ago
1996
ACM
We show that in the worst case, (ndd=2e;1 +n logn) sidedness queries are required to determine whether the convex hull of n points in IRd is simplicial, or to determine the number ...
COMPGEOM
1996
ACM
13 years 11 months ago
1996
ACM
We show that any simply connected (but not necessarily convex) polyhedron with an even number of quadrilateral sides can be partitioned into O(n) topological cubes, meeting face t...
COMPGEOM
1996
ACM
13 years 11 months ago
1996
ACM
We provideO(n)-timealgorithmsfor constructingthe following types of drawings of n-vertex 3-connectedplanar graphs: 2D convex grid drawings with (3n) (3n=2) area under the edge L1-...
COMPGEOM
1996
ACM
13 years 11 months ago
1996
ACM
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...
COMPGEOM
1996
ACM
13 years 11 months ago
1996
ACM
In this paper we show how to traverse a subdivision and to report all cells, edges and vertices, without making use of mark bits in the structure or a stack. We do this by perform...
COMPGEOM
1996
ACM
13 years 11 months ago
1996
ACM
DGCI
1997
Springer
13 years 11 months ago
1997
Springer
A new classification of digital curves into boundary curves and visual curves of different thickness is suggested. A fast algorithm for recognizing digital straight line segments i...
COMPGEOM
1997
ACM
13 years 11 months ago
1997
ACM
Within industrial contexts, a common view of the level of confidence needed in CAD data transfer processes may be expressed as “1 don’t mind if the [CAD data- tmnsfer] algorit...