Complexity of computing nice viewpoints of objects in space

Godfried T. Toussaint

doi:10.1117/12.404814

23 October 2000 Complexity of computing nice viewpoints of objects in space

Godfried T. Toussaint

Author Affiliations +

Proceedings Volume 4117, Vision Geometry IX; (2000) https://doi.org/10.1117/12.404814
Event: International Symposium on Optical Science and Technology, 2000, San Diego, CA, United States

Abstract

A polyhedral object in 3-dimensional space is often well represented by a set of points and line segments that act as its features. By a nice viewpoint of an object we mean a projective view in which all (or most) of the features of the object, relevant for some task, are clearly visible. Such a view is often called a non-degenerate view or projection. In this paper we are concerned with computing non-degenerate orthogonal and perspective projections of sets of points and line segments (objects) in 3-dimensional space. We outline the areas in which such problems arise, discuss recent research on the computational complexity of these problems, illustrate the fundamental ideas used in the design of algorithms for computing non-degenerate projections, and provide pointers to the literature where the results can be found.

Citation Download Citation

Godfried T. Toussaint "Complexity of computing nice viewpoints of objects in space", Proc. SPIE 4117, Vision Geometry IX, (23 October 2000); https://doi.org/10.1117/12.404814

Access the abstract

PROCEEDINGS
11 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY