Journal Article10.1016/J.CAG.2017.07.003
Efficiently computing feature-aligned and high-quality polygonal offset surfaces
11
TL;DR: This paper proposes a super-linear convergent algorithm to generate a well-triangulated and feature-aligned offset surface based on particle system that has significant advantages in terms of meshing quality, computational performance, topological correctness and feature alignment.
read more
About: This article is published in Computers & Graphics. The article was published on 01 Feb 2018. The article focuses on the topics: Point cloud & Parametric surface.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Offset Triangular Mesh using Multiple Normal Vectors of a Vertex
SJ Kim,DY Lee,Min-Yang Yang +2 more
- 01 Jan 2004
TL;DR: In this paper, the authors proposed a method for offsetting triangular mesh by moving all vertices along the multiple normal vectors of a vertex, while the two vectors with the smallest difference are joined repeatedly until the difference is smaller than allowance.
48
Structural Design Using Laplacian Shells
TL;DR: A method to design lightweight shell objects that are structurally robust under the external forces they may experience during use by proposing a shape parametrization based on the solution to the Laplace's equation that guarantees smooth and intersection‐free shell boundaries.
14
Half-Space Power Diagrams and Discrete Surface Offsets
TL;DR: In this article, the authors present an efficient, trivially parallelizable algorithm to compute offset surfaces of shapes discretized using a dexel data structure, based on a two-stage sweeping procedure that is simple to implement and efficient.
•Posted Content
Half-Space Power Diagrams and Discrete Surface Offsets
TL;DR: An efficient, trivially parallelizable algorithm to compute offset surfaces of shapes discretized using a dexel data structure based on properties ofhalf-space power diagrams, where each seed is only visible by a half-space, which were never used before for the computation of surface offsets.
4
•Posted Content
Structural Design Using Laplacian Shells
TL;DR: In this paper, a shape parametrization based on the solution to the Laplace's equation is proposed to ensure smooth and intersection-free shell boundaries, which provides a practical solution for the structural design of hollow objects with a single inner cavity.
4
References
Centroidal Voronoi Tessellations: Applications and Algorithms
TL;DR: Some applications of centroidal Voronoi tessellations to problems in image compression, quadrature, finite difference methods, distribution of resources, cellular biology, statistics, and the territorial behavior of animals are given.
Re-tiling polygonal surfaces
Greg Turk
- 01 Jul 1992
TL;DR: This paper shows how a new set of vertices can be distributed over the surface of a model and connected to one another to create a re-tiling of a surface that is faithful to both the geometry and the topology of the original surface.
A new mesh generation scheme for arbitrary planar domains
TL;DR: A new algorithm to generate interior nodes within any arbitrary multi-connected regions by a completely revised technique in an efficient and stable manner to generate 3-node or 6-node triangular element meshes of great variety within the most irregular heterogeneous regions.
495
Using particles to sample and control implicit surfaces
Andrew Witkin,Paul S. Heckbert +1 more
- 24 Jul 1994
TL;DR: By varying the radius of repulsion adaptively, and fissioning or killing particles based on the local density, this work can achieve good sampling distributions very rapidly, and maintain them even in the face of rapid and extreme deformations and changes in surface topology.