COMPGEOM
1995
ACM
13 years 9 months ago
1995
ACM
Abstract. We show that there is a matching between the edges of any two triangulations of a planar point set such that an edge of one triangulation is matched either to the identic...
COMPGEOM
1995
ACM
13 years 9 months ago
1995
ACM
This paper presents an experimental comparison of a number of different algorithms for computing the Deluanay triangulation. The algorithms examined are: Dwyer’s divide and conq...
JCDCG
2000
Springer
13 years 9 months ago
2000
Springer
We consider the following problem. Let n 2, b 1 and q 2 be integers. Let R and B be two disjoint sets of n red points and bn blue points in the plane, respectively, such that no...
JCDCG
2000
Springer
13 years 9 months ago
2000
Springer
JCDCG
2000
Springer
13 years 9 months ago
2000
Springer
We present a simple and practical data structure for storing a (not necessarily convex) polyhedron P which can, given a query surface S cutting the polyhedron, determine the volume...
JCDCG
2000
Springer
13 years 9 months ago
2000
Springer
JCDCG
2000
Springer
13 years 9 months ago
2000
Springer
We study intersection properties of systems of segments in the plane. In particular, we show that there exists a constant c > 0 such that every system S of n straight-line segme...
JCDCG
2000
Springer
13 years 9 months ago
2000
Springer
JCDCG
2000
Springer
13 years 9 months ago
2000
Springer
A k-dissection D of a polygon P, is a partition of P into a set of subpolygons {Q1, . . . , Qm} with disjoint interiors such that these can be reassembled to form k polygons P1, ....
JCDCG
2000
Springer
13 years 9 months ago
2000
Springer