Computing nice projections of convex polyhedra

Authors:
Md. Ashraful Alam;Masud Hasan
Affiliations:
Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh;Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh
Venue:
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Year:
2008

Citing 7
Cited 0

A simple method for computing general position in displaying three-dimensional objects

Computer Vision, Graphics, and Image Processing
Visibility, occlusion, and the aspect graph

International Journal of Computer Vision
Finding the optimal shadows of a convex polytope

SCG '85 Proceedings of the first annual symposium on Computational geometry
Voronoi diagrams on the sphere

Computational Geometry: Theory and Applications
Finding the Best Viewpoints for Three-Dimensional Graph Drawings

GD '97 Proceedings of the 5th International Symposium on Graph Drawing
On Removing Non-degeneracy Assumptions in Computational Geometry

CIAC '97 Proceedings of the Third Italian Conference on Algorithms and Complexity
Introducing a New Problem: Shape-from-Silhouette when the Relative Positions of the Viewpoints is Unknown

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In an orthogonal projection of a convex polyhedron P the visibility ratio of a face f (similarly of an edge e) is the ratio of orthogonally projected area of f (length of e) and its actual area (length). In this paper we give algorithms for nice projections of P such that the minimum visibility ratio over all visible faces (over all visible edges) is maximized.