COMPGEOM
1997
ACM
13 years 10 months ago
1997
ACM
We consider the family of area bisectors of a polygon possibly with holes in the plane. We say that two bisectors of a polygon P are combinatorially distinct if they induce di e...
COMPGEOM
1997
ACM
13 years 10 months ago
1997
ACM
Many algorithms developed in computational geometry are needlessly complicated and slow because they have to be prepared for very complicated, hypothetical inputs. To avoid this, ...
COMPGEOM
1997
ACM
13 years 10 months ago
1997
ACM
COMPGEOM
1997
ACM
13 years 10 months ago
1997
ACM
COMPGEOM
1997
ACM
13 years 10 months ago
1997
ACM
We describe the first known algorithm for efficiently maintaining a Binary Space Partition (BSP) for n continuously moving segments in the plane, whose interiors remain disjoint...
JCDCG
1998
Springer
13 years 10 months ago
1998
Springer
JCDCG
1998
Springer
13 years 10 months ago
1998
Springer
Abstract. We survey results in a recent branch of computational geometry: folding and unfolding of linkages, paper, and polyhedra. Contents
JCDCG
1998
Springer
13 years 10 months ago
1998
Springer
In this paper we study the following problem: how to divide a cake among the children attending a birthday party such that all the children get the same amount of cake and the same...
JCDCG
1998
Springer
13 years 10 months ago
1998
Springer
We study the minimum number g(m, n) (respectively, p(m, n)) of pieces needed to dissect a regular m-gon into a regular n-gon of the same area using glass-cuts (respectively, polygo...
JCDCG
1998
Springer
13 years 10 months ago
1998
Springer
