Computational geometry: an introduction
Computational geometry: an introduction
Constructing arrangements of lines and hyperplanes with applications
SIAM Journal on Computing
Machine interpretation of line drawings
Machine interpretation of line drawings
3-D multiview object representation for model-based object recognition
Pattern Recognition
Visibility, occlusion, and the aspect graph
International Journal of Computer Vision
Viewpoint from occluding contour
CVGIP: Image Understanding - Special issue on directions in CAD-based vision
An optimal algorithm for intersecting line segments in the plane
Journal of the ACM (JACM)
An optimal algorithm for finding segments intersections
Proceedings of the eleventh annual symposium on Computational geometry
Reverse search for enumeration
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
How many 2D silhouettes does it take to reconstruct a 3D object?
Computer Vision and Image Understanding
The common exterior of convex polygons in the plane
Computational Geometry: Theory and Applications
On incremental rendering of silhouette maps of polyhedral scene
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Efficient perspective-accurate silhouette computation and applications
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Finding the Best Viewpoints for Three-Dimensional Graph Drawings
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Output Sensitive Extraction of Silhouettes from Polygonal Geometry
PG '99 Proceedings of the 7th Pacific Conference on Computer Graphics and Applications
Interleaving 3D Model Feature Prediction and Matching to Support Multi-Sensor Object Recognition
ICPR '96 Proceedings of the 1996 International Conference on Pattern Recognition (ICPR '96) Volume I - Volume 7270
IEEE Transactions on Pattern Analysis and Machine Intelligence
| Hi-index | 0.00 |
Silhouettes of polyhedra are an important primitive in application areas such as machine vision and computer graphics. In this paper, we study how to select view points of convex polyhedra such that the silhouette satisfies certain properties. Specifically, we give algorithms to find all projections of a convex polyhedron such that a given set of edges, faces and/or vertices appear on the silhouette. We present an algorithm to solve this problem in O(k^2) time for k edges. For orthogonal projections, we give an improved algorithm that is fully adaptive in the number l of connected components formed by the edges, and has a time complexity of O(klogk+kl). We then generalize this algorithm to edges and/or faces appearing on the silhouette.