Kaul, 1993 - Google Patents
Computing Minkowski sumsKaul, 1993
- Document ID
- 836655133754573320
- Author
- Kaul A
- Publication year
External Links
Snippet
Minkowski sums are a useful tool for applications of geometric modelling and the sum of two given regions can be regarded as the region generated by sweeping a given region along the other. Though the sums have often been applied, and their theoretical properties …
- 238000004364 calculation method 0 abstract description 8
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
- 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
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
- G06T17/30—Polynomial surface description
-
- 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/10—Constructive solid geometry [CSG] using solid primitives, e.g. cylinders, cubes
-
- 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
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
- G06T17/005—Tree description, e.g. octree, quadtree
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
- G06T11/20—Drawing from basic elements, e.g. lines or circles
-
- 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/05—Geographic models
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
- G06T11/40—Filling a planar surface by adding surface attributes, e.g. colour or texture
-
- 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/30—Information retrieval; Database structures therefor; File system structures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T15/00—3D [Three Dimensional] image rendering
- G06T15/10—Geometric effects
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T15/00—3D [Three Dimensional] image rendering
- G06T15/06—Ray-tracing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T9/00—Image coding, e.g. from bit-mapped to non bit-mapped
- G06T9/001—Model-based coding, e.g. wire frame
-
- 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
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Fortune | Voronoi diagrams and Delaunay triangulations | |
Rossignac et al. | Offsetting operations in solid modelling | |
Casale | Free-form solid modeling with trimmed surface patches | |
Farin | NURBS for curve & surface design: from projective geometry to practical use | |
Lodha et al. | Scattered data techniques for surfaces | |
Shephard et al. | Automatic three‐dimensional mesh generation by the finite octree technique | |
Bischoff et al. | Automatic restoration of polygon models | |
Lopes et al. | Improving the robustness and accuracy of the marching cubes algorithm for isosurfacing | |
US5159512A (en) | Construction of minkowski sums and derivatives morphological combinations of arbitrary polyhedra in cad/cam systems | |
Gursoz et al. | Boolean set operations on non-manifold boundary representation objects | |
Gangnet et al. | Incremental computation of planar maps | |
Tuohy et al. | Approximation of measured data with interval B-splines | |
US20080297503A1 (en) | System and method for reconstructing a 3D solid model from a 2D line drawing | |
Kaul | Computing Minkowski sums | |
Campen et al. | Walking on broken mesh: Defect‐tolerant geodesic distances and parameterizations | |
Eastman et al. | A review of solid shape modelling based on integrity verification | |
Theisel | Exact isosurfaces for marching cubes | |
Culver | Computing the medial axis of a polyhedron reliably and efficiently | |
Cho et al. | Topologically reliable approximation of trimmed polynomial surface patches | |
Kaul | Minkowski sums: A simulation tool for CAD/CAM | |
Guéziec et al. | Cutting and stitching: Efficient conversion of a non-manifold polygonal surface to a manifold | |
Hohmeyer | Robust and efficient surface intersection for solid modeling | |
Seong et al. | Contouring 1-and 2-manifolds in arbitrary dimensions | |
Lee et al. | Primitive geometric operations on planar algebraic curves with Gaussian approximation | |
Urick et al. | Reconstruction of Trimmed NURBS Surfaces for Gap-Free Intersections |