D‐Charts: Quasi‐Developable Mesh Segmentation

@article{Julius2005DChartsQM,
  title={D‐Charts: Quasi‐Developable Mesh Segmentation},
  author={Dan Julius and Vladislav Kraevoy and Alla Sheffer},
  journal={Computer Graphics Forum},
  year={2005},
  volume={24}
}
Quasi-developable mesh segmentation is required for many applications in graphics and CAD, including texture atlas generation and the design of patterns for model fabrication from sheets of material. [...] Key Method Thanks to this metric, using our segmentation for texture atlas generation, we can bound the distortion of the atlas directly during the segmentation stage. We demonstrate that by using this bound, we generate more isometric atlases for the same number of charts compared to existing state-of-the…Expand
Developable surface processing methods for three-dimensional meshes
Developable surfaces are of great significance in computer graphics as they play a key role in many applications involving planar surface parameterization. Industries where 3D objects are constructedExpand
Mesh segmentation driven by Gaussian curvature
TLDR
A new segmentation method for the generation of charts that can be flattened efficiently and shows that charts generated in this way have less distortion compared to charts generated by other methods. Expand
Quasi-Developable Mesh Surface Interpolation via Mesh Deformation
  • K. Tang, Ming Chen
  • Computer Science, Medicine
  • IEEE Transactions on Visualization and Computer Graphics
  • 2009
TLDR
A new algorithm for finding a most "developable" smooth mesh surface to interpolate a given set of arbitrary points or space curves is presented, which linearize those nonlinear constraints using Taylor expansion and eventually construct a sparse and over-determined linear system which is subsequently solved by a robust least-squares solution. Expand
Computing Length-Preserved Free Boundary for Quasi-Developable Mesh Segmentation
  • Charlie C. L. Wang
  • Computer Science, Medicine
  • IEEE Transactions on Visualization and Computer Graphics
  • 2008
TLDR
A method to compute the length-preserved free boundary (LPFB) of a mesh patch which speeds up the mesh parameterization and the distortion on parameterization can then be employed as the criterion in a trial-and-error algorithm for segmenting a given model into nearly developable atlases. Expand
Boundary smoothing for mesh segmentation
TLDR
To achieve further smoothing, some triangles are split by adding points and edges based on virtual triangle subdivision and the graph cut approach to achieve significant further straightening of boundaries with simple straightest geodesics. Expand
Spectral mesh segmentation
Polygonal meshes are ubiquitous in geometric modeling. They are widely used in many applications, such as computer games, computer-aided design, animation, and visualization. One of the importantExpand
SeamCut: interactive mesh segmentation for parameterization
TLDR
This work proposes SeamCut, an analytic and interactive segmentation framework to build an organized set of curves, cuts and seams, prior to surface parameterization, and evaluates the live surface analysis system on a variety of models and report interactive performances. Expand
Paper-craft from 3D polygonal models using generalized cylinders
We introduce an algorithm for approximating a 2-manifold 3D mesh by a set of developable surfaces. Each developable surface is a generalized cylinder represented as a strip of triangles notExpand
Topology-driven shape chartification
TLDR
A novel algorithm to decompose a 3D object into an atlas of disk-like charts with controlled shape and topology is proposed, which can be of two types: topological quads and topological octagons. Expand
Papercraft Models using Generalized Cylinders
TLDR
An algorithm for approximating a 2-manifold 3D mesh by a set of developable surfaces represented as a strip of triangles not necessarily taken from the original mesh is introduced. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 38 REFERENCES
Bounded-distortion piecewise mesh parameterization
TLDR
This paper presents a simple and fast method for computing parameterizations with strictly bounded distortion, and is the first method to compute the mesh partitioning and the parameterization simultaneously and entirely automatically, while providing guaranteed distortion bounds. Expand
Fitting smooth surfaces to dense polygon meshes
TLDR
This thesis presents algorithms and an end-to-end software system for converting dense irregular polygon meshes of arbitrary topology into tensor product B-spline surface patches with accompanying displacement maps, and presents efficient techniques for representing, creating and editing curves on dense polygonal surfaces. Expand
Least squares conformal maps for automatic texture atlas generation
TLDR
This paper introduces a new quasi-conformal parameterization method, based on a least-squares approximation of the Cauchy-Riemann equations, which can parameterize large charts with complex borders, and introduces segmentation methods to decompose the model into charts with natural shapes, and a new packing algorithm to gather them in texture space. Expand
Texture mapping progressive meshes
TLDR
This work presents a method to construct a progressive mesh (PM) such that all meshes in the PM sequence share a common texture parametrization, and demonstrates using such atlases to sample color and normal maps over several models. Expand
Intrinsic Parameterizations of Surface Meshes
TLDR
This paper presents new theoretical and practical results on the parameterization of triangulated surface patches and proposes robust, efficient and tunable tools to obtain least‐distorted parameterizations automatically. Expand
Geometry images
TLDR
This paper proposes to remesh an arbitrary surface onto a completely regular structure the authors call a geometry image, which captures geometry as a simple 2D array of quantized points. Expand
Automatic texture atlas generation from trimmed NURBS models
TLDR
This work presents a method for automatic generation of a texture atlas directly from trimmed N URBS models, while preserving the original NURBS representation. Expand
Parameterization of Faceted Surfaces for Meshing using Angle-Based Flattening
TLDR
A new method to compute planar triangulations of faceted surfaces for surface parameterization that defines the flattening problem as a constrained optimization problem in terms of angles (only), which makes the method more stable and robust than previous approaches, which used node locations in their formulations. Expand
Iso-charts: stretch-driven mesh parameterization using spectral analysis
TLDR
This work describes a fully automatic method, called iso-charts, to create texture atlases on arbitrary meshes, and is the first to consider stretch not only when parameterizing charts, but also when forming charts, providing improvement in applications like geometric remeshing. Expand
Multi-Chart Geometry Images
TLDR
This work introduces multi-chart geometry images, a new representation for arbitrary surfaces created by resampling a surface onto a regular 2D grid that provides greater geometric fidelity, particularly for shapes with long extremities, high genus, or disconnected components. Expand
...
1
2
3
4
...