Generating realistic roofs over a rectilinear polygon

Authors:
Hee-Kap Ahn;Sang Won Bae;Christian Knauer;Mira Lee;Chan-Su Shin;Antoine Vigneron
Affiliations:
Department of Computer Science and Engineering, POSTECH, Pohang, Korea;Department of Computer Science, Kyonggi University, Suwon, Korea;Institute of Computer Science, Universität Bayreuth, Bayreuth, Germany;Department of Computer Science, KAIST, Daejeon, Korea;Department of Digital and Information Engineering, Hankuk University of Foreign Studies, Yongin, Korea;Geometric Modeling and Scientific Visualization Center, KAUST, Thuwal, Saudi Arabia
Venue:
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Year:
2011

Citing 8
Cited 0

Angular Bisector Network, a Simplified Generalized Voronoi Diagram: Application to Processing Complex Intersections in Biomedical Images

IEEE Transactions on Pattern Analysis and Machine Intelligence
Straight-skeleton based contour interpolation

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Straight Skeletons for General Polygonal Figures in the Plane

COCOON '96 Proceedings of the Second Annual International Conference on Computing and Combinatorics
Polygon decomposition based on the straight line skeleton

Proceedings of the nineteenth annual symposium on Computational geometry
Automatically generating large urban environments based on the footprint data of buildings

SM '03 Proceedings of the eighth ACM symposium on Solid modeling and applications
Motorcycle Graphs and Straight Skeletons

Algorithmica
Theoretical and practical results on straight skeletons of planar straight-line graphs

Proceedings of the twenty-seventh annual symposium on Computational geometry
Hinged dissection of polypolyhedra

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a simple rectilinear polygon P in the xy-plane, a roof over P is a terrain over P whose faces are supported by planes through edges of P that make a dihedral angle π/4 with the xy-plane. In this paper, we introduce realistic roofs by imposing a few additional constraints. We investigate the geometric and combinatorial properties of realistic roofs, and show a connection with the straight skeleton of P. We show that the maximum possible number of distinct realistic roofs over P is $(n-4)/2 \choose \lfloor(n-4)/4\rfloor$ when P has n vertices. We present an algorithm that enumerates a combinatorial representation of each such roof in O(1) time per roof without repetition, after O(n4) preprocessing time. We also present an O(n5)-time algorithm for computing a realistic roof with minimum height or volume.