13 search results - page 3 / 3 » compgeom 1996 |
COMPGEOM
1996
ACM
13 years 9 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 9 months ago
1996
ACM
A triangulation of a point set Pn is a partitioning of the convex hull Conv(Pn) into a set of triangles with disjoint interiors such that the vertices of these triangles are in Pn...
COMPGEOM
1996
ACM
13 years 9 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-...