In this paper, we propose a generic framework for 3D surface remeshing. Based on a metric-driven Discrete Voronoi Diagram construction, our output is an optimized 3D triangular mesh with a user defined vertex budget. Our approach can deal with a wide range of applications, from high quality mesh generation to shape approximation. By using appropriate metric constraints the method generates isotropic or anisotropic elements. Based on point-sampling, our algorithm combines the robustness and theoretical strength of Delaunay criteria with the efficiency of entirely discrete geometry processing . Besides the general described framework, we show experimental results using isotropic, quadric-enhanced isotropic and anisotropic metrics which prove the efficiency of our method on large meshes, for a low computational cost.
Download full-text PDF |
Source |
|---|---|
| http://dx.doi.org/10.1109/TVCG.2007.70430 | DOI Listing |
Publication Analysis
Top Keywords
Similar Publications
On Angles in Higher Order Brillouin Tessellations and Related Tilings in the Plane.
Discrete Comput Geom
September 2023
IST Austria (Institute of Science and Technology Austria), Klosterneuburg, Austria.
For a locally finite set in , the order- Brillouin tessellations form an infinite sequence of convex face-to-face tilings of the plane. If the set is coarsely dense and generic, then the corresponding infinite sequences of minimum and maximum angles are both monotonic in . As an example, a stationary Poisson point process in is locally finite, coarsely dense, and generic with probability one.
View Article and Find Full Text PDFStudy on the Morphological Distribution and Modeling Methods of River Particles in Upstream and Downstream Sections.
Materials (Basel)
October 2024
National Engineering Laboratory of Highway Maintenance Technology, Changsha University of Science & Technology, Changsha 410114, China.
Article Synopsis
- The study explores how river particles change shape and behave mechanically during sediment transport, noting a progression from more angular to rounded shapes as particles move downstream.
- Upstream particles are found to be angular, while downstream particles become rounded due to erosion, described mathematically with morphological indices and a unified abrasion function.
- The research employs techniques like the Loop subdivision method and the Discrete Element Method (DEM) to simulate rounding and assess the stability of particles, revealing angles of repose that correlate well with real-world observations.
Advances and Challenges in Milestoning Simulations for Drug-Target Kinetics.
J Chem Theory Comput
November 2024
Department of Molecular Biology, University of California San Diego, La Jolla, California 92093, United States.
Molecular dynamics simulations have become indispensable for exploring complex biological processes, yet their limitations in capturing rare events hinder our understanding of drug-target kinetics. In this Perspective, we investigate the domain of milestoning simulations to understand this challenge. The milestoning approach divides the phase space of the drug-target complex into discrete cells, offering extended time scale insights.
View Article and Find Full Text PDFHigh-Fugacity Expansion and Crystallization in Non-sliding Hard-Core Lattice Particle Models Without a Tiling Constraint.
J Stat Phys
October 2024
Department of Mathematics, Rutgers University, Piscataway, USA.
In this paper, we prove the existence of a crystallization transition for a family of hard-core particle models on periodic graphs in dimension . We consider only models featuring a single species of particles, which in particular forbids the particles from rotation and reflection, and establish a criterion under which crystallization occurs at sufficiently high densities. The criterion is more general than that in Jauslin and Lebowitz (Commun Math Phys 364:655-682, 2018), as it allows models in which particles do not tile the space in the close-packing configurations, such as discrete hard-disk models.
View Article and Find Full Text PDFUnbounded Regions of High-Order Voronoi Diagrams of Lines and Line Segments in Higher Dimensions.
Discrete Comput Geom
May 2023
Faculty of Informatics, Università della Svizzera italiana, 6900 Lugano, Switzerland.
We study the behavior at infinity of the farthest and the higher-order Voronoi diagram of line segments or lines in a -dimensional Euclidean space. The unbounded parts of these diagrams can be encoded by a on the sphere of directions . We show that the combinatorial complexity of the Gaussian map for the order- Voronoi diagram of line segments and lines is , which is tight for .
View Article and Find Full Text PDFWant AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!