Generating realistic roofs over a rectilinear polygon
dc.contributor.author | Ahn, Heekap | |
dc.contributor.author | Bae, Sangwon | |
dc.contributor.author | Knauer, Christian | |
dc.contributor.author | Lee, Mira | |
dc.contributor.author | Shin, Chansu | |
dc.contributor.author | Vigneron, Antoine E. | |
dc.date.accessioned | 2015-08-04T06:24:29Z | |
dc.date.available | 2015-08-04T06:24:29Z | |
dc.date.issued | 2011 | |
dc.identifier.citation | Ahn, H.-K., Bae, S. W., Knauer, C., Lee, M., Shin, C.-S., & Vigneron, A. (2011). Generating Realistic Roofs over a Rectilinear Polygon. Lecture Notes in Computer Science, 60–69. doi:10.1007/978-3-642-25591-5_8 | |
dc.identifier.isbn | 9783642255908 | |
dc.identifier.issn | 03029743 | |
dc.identifier.doi | 10.1007/978-3-642-25591-5_8 | |
dc.identifier.uri | http://hdl.handle.net/10754/564348 | |
dc.description.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)/4⌋ (n-4)/2) 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(n 4) preprocessing time. We also present an O(n 5)-time algorithm for computing a realistic roof with minimum height or volume. © 2011 Springer-Verlag. | |
dc.publisher | Springer Nature | |
dc.title | Generating realistic roofs over a rectilinear polygon | |
dc.type | Conference Paper | |
dc.contributor.department | Visual Computing Center (VCC) | |
dc.contributor.department | Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division | |
dc.contributor.department | Computer Science Program | |
dc.contributor.department | Geometric Algorithms Group | |
dc.identifier.journal | Lecture Notes in Computer Science | |
dc.conference.date | 5 December 2011 through 8 December 2011 | |
dc.conference.name | 22nd International Symposium on Algorithms and Computation, ISAAC 2011 | |
dc.conference.location | Yokohama | |
dc.contributor.institution | Department of Computer Science and Engineering, POSTECH, Pohang, South Korea | |
dc.contributor.institution | Department of Computer Science, Kyonggi University, Suwon, South Korea | |
dc.contributor.institution | Institute of Computer Science, Universität Bayreuth, 95440 Bayreuth, Germany | |
dc.contributor.institution | Department of Computer Science, KAIST, Daejeon, South Korea | |
dc.contributor.institution | Department of Digital and Information Engineering, Hankuk University of Foreign Studies, Yongin, South Korea | |
kaust.person | Vigneron, Antoine E. |
This item appears in the following Collection(s)
-
Conference Papers
-
Computer Science Program
For more information visit: https://cemse.kaust.edu.sa/cs -
Visual Computing Center (VCC)
-
Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division
For more information visit: https://cemse.kaust.edu.sa/