113 search results - page 1 / 23 » On the Area Bisectors of a Polygon |
COMPGEOM
1997
ACM
13 years 9 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...
DCG
1999
13 years 4 months ago
1999
COMPIMAGE
2010
Springer
13 years 12 months ago
2010
Springer
Abstract. This paper presents a theoretical generalization of the circumcenter as the intersection of generalized perpendicular bisectors. We define generalized bisectors between ...
SMI
2006
IEEE
13 years 11 months ago
2006
IEEE
Symbolic computation of NURBS plays an important role in many areas of NURBS-based geometric computation and design. However, any nontrivial symbolic computation, especially when ...
CORR
2012
Springer
12 years 22 days ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...