Abstract
A half-plane probe through a polygon measures the area of intersection between a half-plane and the polygon. We develop techniques based on X-ray probing to determine convex n-gons in 7n + 7 half-plane probes. We also show n + 1 half-plane probes are sufficient to verify a specified convex polygon and prove linear lower bounds for determination and verification.
| Original language | English |
|---|---|
| Pages (from-to) | 359-374 |
| Number of pages | 16 |
| Journal | Journal of Algorithms |
| Volume | 12 |
| Issue number | 3 |
| DOIs | |
| State | Published - Sep 1991 |
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver