[go: up one dir, main page]

Zhang et al., 2018 - Google Patents

Triangulation of simple arbitrarily shaped polyhedra by cutting off one vertex at a time

Zhang et al., 2018

View PDF
Document ID
7336689401046187684
Author
Zhang Q
Lin S
Ding X
Wu A
Publication year
Publication venue
International Journal for Numerical Methods in Engineering

External Links

Snippet

We describe a heuristic method of triangulating arbitrarily shaped polyhedra without the addition of Steiner points. The polyhedra are simple, with each vertex connected to at least 3 other vertices (ie, coplanarity and colinearity are not considered). They may, however, be …
Continue reading at www.researchgate.net (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/50—Computer-aided design
    • G06F17/5086—Mechanical design, e.g. parametric or variational design
    • 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
    • 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
    • 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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T2219/00—Indexing scheme for manipulating 3D models or images for computer graphics
    • G06T2219/20—Indexing scheme for editing of 3D models
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2217/00—Indexing scheme relating to computer aided design [CAD]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T2210/00—Indexing scheme for image generation or computer graphics
    • G06T2210/12—Bounding box
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T11/00—2D [Two Dimensional] image generation

Similar Documents

Publication Publication Date Title
Nieser et al. Cubecover–parameterization of 3d volumes
Pietroni et al. Tracing field‐coherent quad layouts
JP5848030B2 (en) Calculation of the triangulated polyhedral closed surface resulting from the first modeled object and the second modeled object
Ledoux On the validation of solids represented with the international standards for geographic information
Razafindrazaka et al. Perfect matching quad layouts for manifold meshes
Si et al. 3D boundary recovery by constrained Delaunay tetrahedralization
Fogg et al. Automatic generation of multiblock decompositions of surfaces
US20210358208A1 (en) Method, device and computer readable storage medium for generating volume foliation
Friedrich et al. Optimizing evolutionary csg tree extraction
Xu et al. Polyline‐sourced Geodesic Voronoi Diagrams on Triangle Meshes
Mei Summary on several key techniques in 3D geological modeling
Bawin et al. Automatic feature‐preserving size field for three‐dimensional mesh generation
Chen et al. Improvements in the reliability and element quality of parallel tetrahedral mesh generation
Tong et al. HybridOctree_Hex: Hybrid octree-based adaptive all-hexahedral mesh generation with Jacobian control
Lou et al. Merging enriched finite element triangle meshes for fast prototyping of alternate solutions in the context of industrial maintenance
US20210082182A1 (en) Layered Meshing for Additive Manufacturing Simulations
Yu et al. PASM: Parallel aligned surface meshing
Zhang et al. Triangulation of simple arbitrarily shaped polyhedra by cutting off one vertex at a time
Li Sliver-free three dimensional delaunay mesh generation
Li et al. An algorithm for filling complex holes in reverse engineering
Georgiadis et al. Indirect all-quadrilateral meshing based on bipartite topological labeling
Hu et al. Voronoi cells of non-general position spheres using the GPU
Bunge et al. Polygon Laplacian Made Robust
Yu et al. Computing 3d shape guarding and star decomposition
Tierney et al. Generating analysis topology using virtual topology operators