Fortune, 1998 - Google Patents

Vertex-rounding a three-dimensional polyhedral subdivision

Fortune, 1998

View PDF
Document ID
13858297057928920686
Author
Fortune S
Publication year
Publication venue
Proceedings of the fourteenth annual symposium on Computational geometry

External Links

Snippet

Let P be a polyhedral subdivision in lR3 with at, otal of n faces. We show ghat t, here is an embedding u of the vertices, edges, and facets of P into a subdivision &, where every vertes coordinate of Q is an integral multiple of 2-p” fian+'l. For each face f of P, the Hausdorff …
Continue reading at dl.acm.org (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/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
    • 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
    • G06T17/205—Re-meshing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2217/00—Indexing scheme relating to computer aided design [CAD]

Similar Documents

Publication Publication Date Title
Fortune Vertex-rounding a three-dimensional polyhedral subdivision
Floater et al. Meshless parameterization and surface reconstruction
Thompson et al. Handbook of grid generation
Cherchi et al. Fast and robust mesh arrangements using floating-point arithmetic
JP4381743B2 (en) Method and program for generating volume data from boundary representation data
Mitchell et al. Pillowing doublets: refining a mesh to ensure that faces share at most one edge
Yerry et al. Automatic three‐dimensional mesh generation by the modified‐octree technique
Trotts et al. Simplification of tetrahedral meshes with error bounds
Dey et al. On good triangulations in three dimensions
Moore Simplicial mesh generation with applications
Alumbaugh et al. Compact array-based mesh data structures
Bern et al. Triangulations and mesh generation
George Automatic mesh generation and finite element computation
Kleiner et al. Geometrization of three-dimensional orbifolds via Ricci flow
Owen Nonsimplicial unstructured mesh generation
CN110598331A (en) Method and device for modeling roof
Kaul Computing Minkowski sums
Gao et al. Rational quadratic approximation to real algebraic curves
KR20010046823A (en) Automatic CAD Model Synthesis From Unorganized 3-D Range Data
Bajaj et al. Hierarchical multiresolution reconstruction of shell surfaces
Zhao et al. Conformal and non-conformal adaptive mesh refinement with hierarchical array-based half-facet data structures
Sugihara How to make geometric algorithms robust
Liu et al. Quadratic and cubic B-splines by generalizing higher-order Voronoi diagrams
Stouffs et al. A formal structure for nonequivalent solid representations
Davy et al. A note on improving the performance of Delaunay triangulation