On the number of views of translates of a cube and related problems.
DOI10.1016/j.comgeo.2003.10.001zbMath1045.65015OpenAlexW2107380557MaRDI QIDQ1428117
Robert Schiffenbauer, Boris Aronov, Micha Sharir
Publication date: 14 March 2004
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2003.10.001
arrangementsvisibilityaspect graphsenvelopesfat objectspolyhedral terrainsorthographic viewscombinaotirla geometryperspective views
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Combinatorial complexity of geometric structures (52C45) Descriptive geometry (51N05)
Cites Work
- On the number of views of polyhedral terrains
- Voronoi diagrams in higher dimensions under certain polyhedral distance functions
- The overlay of lower envelopes and its applications
- The Partition Technique for Overlays of Envelopes
- A tight bound on the number of geometric permutations of convex fat objects in \(\mathbb{R}^d\)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the number of views of translates of a cube and related problems.