Selected papers that cite this one
- Nakhoon Baek and Sung-Yong Shin. On circularly-hidden surface removal. Information Processing Letters, 66(3):119-123, 15 May 1998.
- G. Das, P. J. Heffernan, and G. Narasimhan. Finding all weakly-visible chords of a polygon in linear time. Nordic Journal of Computing, 1(4):433-457, Winter 1994.
- S. Schuierer. An O(log log n) time algorithm to compute the kernel of a polygon. Nordic Journal of Computing, 1(4):458-474, Winter 1994.