Back to Search Start Over

Computing Nice Projections of Convex Polyhedra.

Authors :
Hutchison, David
Kanade, Takeo
Kittler, Josef
Kleinberg, Jon M.
Mattern, Friedemann
Mitchell, John C.
Naor, Moni
Nierstrasz, Oscar
Pandu Rangan, C.
Steffen, Bernhard
Sudan, Madhu
Terzopoulos, Demetri
Tygar, Doug
Vardi, Moshe Y.
Weikum, Gerhard
Nakano, Shin-ichi
Rahman, Md. Saidur
Alam, Md. Ashraful
Hasan, Masud
Source :
WALCOM: Algorithms & Computation; 2008, p111-119, 9p
Publication Year :
2008

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. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISBNs :
9783540778905
Database :
Complementary Index
Journal :
WALCOM: Algorithms & Computation
Publication Type :
Book
Accession number :
34227084
Full Text :
https://doi.org/10.1007/978-3-540-77891-2_11