COMPGEOM
1997
ACM
13 years 9 months ago
1997
ACM
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...
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...
COMPGEOM
1997
ACM
13 years 9 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 9 months ago
1997
ACM
COMPGEOM
1997
ACM
13 years 9 months ago
1997
ACM
COMPGEOM
1997
ACM
13 years 9 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...