659 research outputs found
Dev2PQ: Planar Quadrilateral Strip Remeshing of Developable Surfaces
We introduce an algorithm to remesh triangle meshes representing developable
surfaces to planar quad dominant meshes. The output of our algorithm consists
of planar quadrilateral (PQ) strips that are aligned to principal curvature
directions and closely approximate the curved parts of the input developable,
and planar polygons representing the flat parts of the input. Developable
PQ-strip meshes are useful in many areas of shape modeling, thanks to the
simplicity of fabrication from flat sheet material. Unfortunately, they are
difficult to model due to their restrictive combinatorics and locking issues.
Other representations of developable surfaces, such as arbitrary triangle or
quad meshes, are more suitable for interactive freeform modeling, but generally
have non-planar faces or are not aligned to principal curvatures. Our method
leverages the modeling flexibility of non-ruling based representations of
developable surfaces, while still obtaining developable, curvature aligned
PQ-strip meshes. Our algorithm optimizes for a scalar function on the input
mesh, such that its level sets are extrinsically straight and align well to the
locally estimated ruling directions. The condition that guarantees straight
level sets is nonlinear of high order and numerically difficult to enforce in a
straightforward manner. We devise an alternating optimization method that makes
our problem tractable and practical to compute. Our method works automatically
on any developable input, including multiple patches and curved folds, without
explicit domain decomposition. We demonstrate the effectiveness of our approach
on a variety of developable surfaces and show how our remeshing can be used
alongside handle based interactive freeform modeling of developable shapes
Geometric computing for freeform architecture
Geometric computing has recently found a new field of applications, namely the various geometric problems which lie at the heart of rationalization and construction-aware design processes of freeform architecture. We report on our work in this area, dealing with meshes with planar faces and meshes which allow multilayer constructions (which is related to discrete surfaces and their curvatures), triangles meshes with circle-packing properties (which is related to conformal uniformization), and with the paneling problem. We emphasize the combination of numerical optimization and geometric knowledge.
2D Triangulation Representation Using Stable Catalogs
The problem of representing triangulations has been widely studied to obtain convenient encodings and space efficient data structures. In this paper we propose a new practical approach to reduce the amount of space needed to represent in main memory an arbitrary triangulation, while maintaining constant time for some basic queries. This work focuses on the connectivity information of the triangulation, rather than the geometry information (vertex coordinates), since the combinatorial data represents the main storage part of the structure. The main idea is to gather triangles into patches, to reduce the number of pointers by eliminating the internal pointers in the patches and reducing the multiple references to vertices. To accomplish this, we define stable catalogs of patches that are close under basic standard update operations such as insertion and deletion of vertices, and edge flips. We present some bounds and results concerning special catalogs, and some experimental results for the quadrilateral-triangle catalog
Connectivity Control for Quad-Dominant Meshes
abstract: Quad-dominant (QD) meshes, i.e., three-dimensional, 2-manifold polygonal meshes comprising mostly four-sided faces (i.e., quads), are a popular choice for many applications such as polygonal shape modeling, computer animation, base meshes for spline and subdivision surface, simulation, and architectural design. This thesis investigates the topic of connectivity control, i.e., exploring different choices of mesh connectivity to represent the same 3D shape or surface. One key concept of QD mesh connectivity is the distinction between regular and irregular elements: a vertex with valence 4 is regular; otherwise, it is irregular. In a similar sense, a face with four sides is regular; otherwise, it is irregular. For QD meshes, the placement of irregular elements is especially important since it largely determines the achievable geometric quality of the final mesh.
Traditionally, the research on QD meshes focuses on the automatic generation of pure quadrilateral or QD meshes from a given surface. Explicit control of the placement of irregular elements can only be achieved indirectly. To fill this gap, in this thesis, we make the following contributions. First, we formulate the theoretical background about the fundamental combinatorial properties of irregular elements in QD meshes. Second, we develop algorithms for the explicit control of irregular elements and the exhaustive enumeration of QD mesh connectivities. Finally, we demonstrate the importance of connectivity control for QD meshes in a wide range of applications.Dissertation/ThesisDoctoral Dissertation Computer Science 201
Computational Design of Cold Bent Glass Fa\c{c}ades
Cold bent glass is a promising and cost-efficient method for realizing doubly
curved glass fa\c{c}ades. They are produced by attaching planar glass sheets to
curved frames and require keeping the occurring stress within safe limits.
However, it is very challenging to navigate the design space of cold bent glass
panels due to the fragility of the material, which impedes the form-finding for
practically feasible and aesthetically pleasing cold bent glass fa\c{c}ades. We
propose an interactive, data-driven approach for designing cold bent glass
fa\c{c}ades that can be seamlessly integrated into a typical architectural
design pipeline. Our method allows non-expert users to interactively edit a
parametric surface while providing real-time feedback on the deformed shape and
maximum stress of cold bent glass panels. Designs are automatically refined to
minimize several fairness criteria while maximal stresses are kept within glass
limits. We achieve interactive frame rates by using a differentiable Mixture
Density Network trained from more than a million simulations. Given a curved
boundary, our regression model is capable of handling multistable
configurations and accurately predicting the equilibrium shape of the panel and
its corresponding maximal stress. We show predictions are highly accurate and
validate our results with a physical realization of a cold bent glass surface
Quad Meshing
Triangle meshes have been nearly ubiquitous in computer graphics, and a large body of data structures and geometry processing algorithms based on them has been developed in the literature. At the same time, quadrilateral meshes, especially semi-regular ones, have advantages for many applications, and significant progress was made in quadrilateral mesh generation and processing during the last several years. In this State of the Art Report, we discuss the advantages and problems of techniques operating on quadrilateral meshes, including surface analysis and mesh quality, simplification, adaptive refinement, alignment with features, parametrization, and remeshing
- …