Loading...
Please wait, while we are loading the content...
Similar Documents
On the area bisectors of a polygon (1998).
| Content Provider | CiteSeerX |
|---|---|
| Author | Böhringer, Karl-Friedrich Donald, Bruce Randall Halperin, Dan |
| Abstract | We consider the family of lines that are 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#erent partitionings of the vertices of P . We derive an algebraic characterization of area bisectors. We then show that there are simple polygons with n vertices that have# #n 2 # combinatorially distinct area bisectors #matching the obvious upper bound#, and present an output-sensitive algorithm for computing an explicit representation of all the bisectors of a given polygon. # Work on this paper by Karl-FriedrichB#ohringer and Bruce Randall Donald has been supported in part by the National Science Foundation under grants no. IRI-8802390, IRI-9000532, IRI-9201699, IRI-9530785, IRI-9896020, by a Presidential Young Investigator award to Bruce Donald, by an NSF#ARPA Small Grant for Exploratory Research no. IRI-9403903, by an NSF CISE Postdoctoral Associateship to Karl B#ohringer no. CDA... |
| File Format | |
| Publisher Date | 1998-01-01 |
| Access Restriction | Open |
| Subject Keyword | Area Bisectors Exploratory Research Di Erent Partitioning Karl Ohringer Nsf Cise Postdoctoral Associateship Bruce Donald Nsf Arpa Small Grant Presidential Young Investigator Award Obvious Upper Bound Distinct Area Bisectors National Science Foundation Explicit Representation Output-sensitive Algorithm Karl-friedrichb Ohringer Simple Polygon Algebraic Characterization |
| Content Type | Text |
| Resource Type | Article |
