Rectilinear computational geometry
In this thesis it is demonstrated that the structure of rectilinear polygons can be exploited to solve a variety of geometric problems efficiently. These problems include: (1) recognizing polygonal properties, such as star-shapedness, monotonicity, and edge-visibility, (2) removing hidden lines, (3)...
Main Author: | Sack, Jörg-Rüdiger. |
---|---|
Format: | Others |
Language: | en |
Published: |
McGill University
1984
|
Subjects: | |
Online Access: | http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=71872 |
Similar Items
-
Investigation of the Development of 7th Grade Students’ Skills to Define, Construct and Classify Polygons with Cabri Geometry
by: Ahmet Yanık, et al.
Published: (2013-03-01) -
Application of computational geometry to pattern recognition problems
by: Bhattacharya, Binay K.
Published: (1981) -
Various stabbing problems in computational geometry
by: Doskas, Michael.
Published: (1987) -
Triangulirajmo mnogokotnik
by: Borut Žalik, et al.
Published: (2000-01-01) -
A Computational Geometry Approach to Digital Image Contour Extraction
by: Tejada, Pedro J.
Published: (2009)