Abstract
Two points p and q are circularly-visible from each other, if there exists a circular arc connecting p and q that does not intersect any obstacles. Circularly-hidden surface removal is to identify the circularly-visible portion of an environment, using the circular rays that are generated by rotating the points on a given half-plane about its bounding line. We first characterize the circularly-projected images of polygonal faces. Then, we show that circularly-hidden surface removal for polyhedral objects can be accomplished in O(n2α(n)) time, where n is the total number of edges of given polyhedrons.
| Original language | English |
|---|---|
| Pages (from-to) | 119-123 |
| Number of pages | 5 |
| Journal | Information Processing Letters |
| Volume | 66 |
| Issue number | 3 |
| DOIs | |
| State | Published - 15 May 1998 |
Keywords
- Algorithms
- Circular visibility
- Circularly-hidden surface removal
- Circularly-visible
- Hidden surface removal
Fingerprint
Dive into the research topics of 'On circularly-hidden surface removal'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver