Generating realistic roofs over a rectilinear polygon

Handle URI:
http://hdl.handle.net/10754/564348
Title:
Generating realistic roofs over a rectilinear polygon
Authors:
Ahn, Heekap; Bae, Sangwon; Knauer, Christian; Lee, Mira; Shin, Chansu; Vigneron, Antoine E. ( 0000-0003-3586-3431 )
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.
KAUST Department:
Visual Computing Center (VCC); Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Computer Science Program; Geometric Algorithms Group
Publisher:
Springer Science + Business Media
Journal:
Lecture Notes in Computer Science
Conference/Event name:
22nd International Symposium on Algorithms and Computation, ISAAC 2011
Issue Date:
2011
DOI:
10.1007/978-3-642-25591-5_8
Type:
Conference Paper
ISSN:
03029743
ISBN:
9783642255908
Appears in Collections:
Conference Papers; Computer Science Program; Visual Computing Center (VCC); Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorAhn, Heekapen
dc.contributor.authorBae, Sangwonen
dc.contributor.authorKnauer, Christianen
dc.contributor.authorLee, Miraen
dc.contributor.authorShin, Chansuen
dc.contributor.authorVigneron, Antoine E.en
dc.date.accessioned2015-08-04T06:24:29Zen
dc.date.available2015-08-04T06:24:29Zen
dc.date.issued2011en
dc.identifier.isbn9783642255908en
dc.identifier.issn03029743en
dc.identifier.doi10.1007/978-3-642-25591-5_8en
dc.identifier.urihttp://hdl.handle.net/10754/564348en
dc.description.abstractGiven 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.en
dc.publisherSpringer Science + Business Mediaen
dc.titleGenerating realistic roofs over a rectilinear polygonen
dc.typeConference Paperen
dc.contributor.departmentVisual Computing Center (VCC)en
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentComputer Science Programen
dc.contributor.departmentGeometric Algorithms Groupen
dc.identifier.journalLecture Notes in Computer Scienceen
dc.conference.date5 December 2011 through 8 December 2011en
dc.conference.name22nd International Symposium on Algorithms and Computation, ISAAC 2011en
dc.conference.locationYokohamaen
dc.contributor.institutionDepartment of Computer Science and Engineering, POSTECH, Pohang, South Koreaen
dc.contributor.institutionDepartment of Computer Science, Kyonggi University, Suwon, South Koreaen
dc.contributor.institutionInstitute of Computer Science, Universität Bayreuth, 95440 Bayreuth, Germanyen
dc.contributor.institutionDepartment of Computer Science, KAIST, Daejeon, South Koreaen
dc.contributor.institutionDepartment of Digital and Information Engineering, Hankuk University of Foreign Studies, Yongin, South Koreaen
kaust.authorVigneron, Antoine E.en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.