Dey et al., 2010 - Google Patents

Localized Delaunay refinement for sampling and meshing

Dey et al., 2010

View PDF
Document ID
2030560250445427981
Author
Dey T
Levine J
Slatton A
Publication year
Publication venue
Computer Graphics Forum

External Links

Snippet

The technique of Delaunay refinement has been recognized as a versatile tool to generate Delaunay meshes of a variety of geometries. Despite its usefulness, it suffers from one lacuna that limits its application. It does not scale well with the mesh size. As the sample …
Continue reading at www.academia.edu (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30575—Replication, distribution or synchronisation of data between databases or within a distributed database; Distributed database system architectures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30067—File systems; File servers
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/20—Handling natural language data
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
    • G06T17/20—Finite element generation, e.g. wire-frame surface description, tesselation

Similar Documents

Publication Publication Date Title
Si et al. 3D boundary recovery by constrained Delaunay tetrahedralization
He et al. The convergence of the bilinear and linear immersed finite element solutions to interface problems
Bertolino et al. An efficient hybrid optimization strategy for surface reconstruction
Zou et al. An algorithm for triangulating multiple 3D polygons
Sastry et al. A parallel log-barrier method for mesh quality improvement and untangling
Dey et al. Localized Delaunay refinement for sampling and meshing
Mu et al. Shape regularity conditions for polygonal/polyhedral meshes, exemplified in a discontinuous Galerkin discretization
Ohrhallinger et al. An efficient algorithm for determining an aesthetic shape connecting unorganized 2d points
Fu et al. Effective derivation of similarity transformations for implicit Laplacian mesh editing
Linardakis et al. Delaunay decoupling method for parallel guaranteed quality planar mesh refinement
Foteinos et al. 4D space–time Delaunay meshing for medical images
Kim et al. A hexahedral-dominant FE meshing technique using trimmed hexahedral elements preserving sharp edges and corners
Bermano et al. Online reconstruction of 3d objects from arbitrary cross-sections
Czubak et al. On the well-posedness of relativistic viscous fluids with non-zero vorticity
Yang et al. Complex 3d general object reconstruction from line drawings
Zhang et al. Surface structured mesh generation system based on symmetry preserving parameterization
Liang et al. Matching interior and exterior all-quadrilateral meshes with guaranteed angle bounds
Zhou et al. A degree-based topological optimization method for triangular meshes
Chernikov et al. Generalized insertion region guides for Delaunay mesh refinement
Quadros An approach for extracting non-manifold mid-surfaces of thin-wall solids using chordal axis transform
Seversky et al. Harmonic point cloud orientation
Taime et al. Comparative study of mesh simplification algorithms
Bhardwaj et al. Curvature informed furthest point sampling
An et al. Quantitative blow-up estimates for spacelike singularities in gravitational-collapse cosmological spacetimes
Jian et al. STEP-based Model Recommendation Method for the Exchange and Reuse of Digital Twins