Computational Network Design from Functional Specifications
Connectivity and layout of underlying networks largely determine agent behavior and usage in many environments. For example, transportation networks determine the flow of traffic in a neighborhood, whereas building floorplans determine the flow of people in a workspace. Designing such networks from scratch is challenging as even local network changes can have large global effects. We investigate how to computationally create networks starting from only high-level functional specifications. Such specifications can be in the form of network density, travel time versus network length, traffic type, destination location, etc. We propose an integer programming-based approach that guarantees that the resultant networks are valid by fulfilling all the specified hard constraints and that they score favorably in terms of the objective function. We evaluate our algorithm in two different design settings, street layout and floorplans to demonstrate that diverse networks can emerge purely from high-level functional specifications.
Computing Layouts with Deformable Templates
Chi-Han Peng, Yong-Liang Yang, and Peter Wonka
ACM Transactions on Graphics (Proceedings of ACM SIGGRAPH 2014)
Project Page | Paper (authors’ version) | Additional Materials | Talk Slides | Fast-Forward Slides
In this paper we tackle the problem of tiling a domain with a set of deformable templates. A valid solution to this problem completely covers the domain with templates such that the templates do not overlap. We generalize existing specialized solutions and formulate a general layout problem by modeling important constraints and admissible template deformations. Our main idea for the solution is to break the layout algorithm into two steps: a discrete step to layout the approximate template positions and a continuous step to refine the template shapes. Our approach is suitable for a large class of applications, including floorplanning, urban layouts, and arts and design.
Chi-Han Peng, Michael Barton, Caigui Jiang, and Peter Wonka
ACM Transactions on Graphics (to be presented at SIGGRAPH 2014)
Project Page | Paper (authors’ version) | Additional Materials | Video (youtube) | Models | Talk Slides | Fast-Forward Slides
We present a framework for exploring topologically unique quadrangulations of an input shape. First, the input shape is segmented into surface patches. Second, different topologies are enumerated and explored in each patch. This is realized by an efficient subdivision-based quadrangulation algorithm that can exhaustively enumerate all mesh topologies within a patch. To help users navigate the potentially huge collection of variations, we propose tools to preview and arrange the results. Furthermore, the requirement that all patches need to be jointly quadrangulatable is formulated as a linear integer program. Finally, we apply the framework to shape-space exploration, remeshing, and design to underline the importance of topology exploration.
Connectivity Editing for Quad-Dominant Meshes
We propose a connectivity editing framework for quad-dominant meshes. In our framework the user can edit the mesh connectivity to control the location, type, and number of irregular vertices (with more or less than four neighbors) and irregular faces (non-quads). We provide a theoretical analysis of the problem, discuss what edits are possible and impossible, and describe how to implement an editing framework that realizes all possible editing operations. In the results we show example edits and illustrate advantages and disadvantages of different strategies for quad-dominant mesh design.
Connectivity Editing for Quadrilateral Meshes
Chi-Han Peng, Eugene Zhang, Yoshihiro Kobayashi, and Peter Wonka
ACM Transactions on Graphics (Proceedings of ACM SIGGRAPH ASIA 2011)
Project Page | Paper | Additional Materials | Video (youtube) | Slides
We propose new connectivity editing operations for quadrilateral meshes with the unique ability to explicitly control the location, orientation, type, and number of the irregular vertices (valence not equal to four) in the mesh while preserving sharp edges. We provide theoretical analysis on what editing operations are possible and impossible and introduce three fundamental operations to move and re-orient a pair of irregular vertices. We argue that our editing operations are fundamental, because they only change the quad mesh in the smallest possible region and involve the fewest irregular vertices (i.e., two). The irregular vertex movement operations are supplemented by operations for the splitting, merging, canceling, and aligning of irregular vertices. We explain how the proposed highlevel operations are realized through graph-level editing operations such as quad collapses, edge flips, and edge splits. The utility of these mesh editing operations are demonstrated by improving the connectivity of quad meshes generated from state-of-art quadrangulation techniques.
User-Assisted Mesh Simplification
Tan-Chi Ho, Yi-Chun Lin, Jung-Hong Chuang, Chi-Han Peng, Yu-Jung Cheng
VRCIA ’06 Proceedings of the 2006 ACM international conference on Virtual reality continuum and its applications
During the last decade, many simplification methods have been proposed to generate multi-resolution meshes for real-time applications. Practitioners have found that these methods alone usually fail to produce satisfactory result when models of very low polygon count are desired. This is due to the fact that the existing methods take no semantic or functional metric into account, and moreover, each error metric has its own strength and weakness. In this paper, we propose a user-assisted mesh simplification framework that allows users to improve the quality of simplified meshes derived by any error metric. The framework consists of two stages. The first stage employs a weighting scheme that allows users to refine a unsatisfactory region to achieve a user-specified resolution. The second stage is a local refinement scheme aiming to provide a user-guided fine-tune to recover local sharp features. The proposed weighting scheme differs from the previous approaches in that the weights are used to directly reorder the edge collapsing sequence rather than weighting the collapsing cost. Such a direct reordering mechanism ensures a predictable increase of resolution in the selected region, and is both error-metric and resolution independent.
Connectivity Control for Quad-Dominant Mesheswith Applications in Urban Design
Advances in Architectural Geometry (AAG) 2014
Feature Detection in Aerial Images
Cheng Pan, Yifan Zhang, and Chi-Han Peng (Advisers: John Femiani, Anshuman Razdan, and Peter Wonka)
SIAM Data Mining Conference (SDM) 2011 Doctoral Forum