Polygon comparison using a graph representation

TL;DR: The proposed algorithm works with concave polygons with holes, and with regions composed of polygon sets, and can be easily adapted to work with self-intersecting polygons.

TL;DR: A solution to the hidden surface elimination problem called Beam Tracing is described and a Hierarchical Scene Representation is proposed that incorporates the space decomposition idea of the BSP tree along with the convex polytope intersection detection technique to solve the intersection and sorting subproblems of beam tracing.

TL;DR: An approach is presented to the tripartite problem of modeling physical solids mathematically, representing the models in a computer, and using representations in geometric algorithms using representation-free (mathematical) models and functions.

TL;DR: A new family of clipping algorithms is described, able to clip polygons against irregular convex plane-faced volumes in three dimensions, removing the parts of the polygon which lie outside the volume.

TL;DR: In this paper, a polygon hidden surface and hidden line removal algorithm is presented, which recursively subdivides the image into polygon shaped windows until the depth order within the window is found.

TL;DR: My approach to computer vision is best characterized as inverse computer graphics, where perceived television pictures are analyzed to compute detailed geometric models to generate synthetic television images.