Campen et al., 2011 - Google Patents
Walking on broken mesh: Defect‐tolerant geodesic distances and parameterizationsCampen et al., 2011
View PDF- Document ID
- 17793191142702796475
- Author
- Campen M
- Kobbelt L
- Publication year
- Publication venue
- Computer Graphics Forum
External Links
Snippet
Efficient methods to compute intrinsic distances and geodesic paths have been presented for various types of surface representations, most importantly polygon meshes. These meshes are usually assumed to be well‐structured and manifold. In practice, however, they …
- 230000015654 memory 0 abstract description 10
Classifications
-
- 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
- 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/05—Geographic models
-
- 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
- G06T15/20—Perspective computation
-
- 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
- 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
- G06T2219/00—Indexing scheme for manipulating 3D models or images for computer graphics
- G06T2219/20—Indexing scheme for editing of 3D models
- G06T2219/2021—Shape modification
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T15/00—3D [Three Dimensional] image rendering
- G06T15/04—Texture mapping
-
- 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
- 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
- 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
- G06T19/00—Manipulating 3D models or images for computer graphics
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T13/00—Animation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T7/00—Image analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2200/00—Indexing scheme for image data processing or generation, in general
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2207/00—Indexing scheme for image analysis or image enhancement
- G06T2207/20—Special algorithmic details
- G06T2207/20112—Image segmentation details
-
- 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 |
|---|---|---|
| Campen et al. | Walking on broken mesh: Defect‐tolerant geodesic distances and parameterizations | |
| US11361503B2 (en) | Systems and methods for generating volumetric models | |
| US8711143B2 (en) | System and method for interactive image-based modeling of curved surfaces using single-view and multi-view feature curves | |
| Sharp et al. | You can find geodesic paths in triangle meshes by just flipping edges | |
| Kuo et al. | A Delaunay-based region-growing approach to surface reconstruction from unorganized points | |
| Schnabel et al. | Completion and reconstruction with primitive shapes | |
| Labatut et al. | Robust and efficient surface reconstruction from range data | |
| Bischoff et al. | Automatic restoration of polygon models | |
| Mehra et al. | Abstraction of man-made shapes | |
| Sheffer et al. | Robust spherical parameterization of triangular meshes | |
| JP4810561B2 (en) | Graphics model conversion apparatus and graphics model processing program for causing computer to function as graphics model conversion apparatus | |
| Di Angelo et al. | A new mesh-growing algorithm for fast surface reconstruction | |
| Cashman | Beyond Catmull–Clark? A survey of advances in subdivision surface methods | |
| CN109983509B (en) | Instant Boolean operation method using geometric surface | |
| Athanasiadis et al. | Feature-based 3D morphing based on geometrically constrained spherical parameterization | |
| Li et al. | Meshless quadrangulation by global parameterization | |
| Yang et al. | Computing Surface PolyCube‐Maps by Constrained Voxelization | |
| JP2002334346A (en) | Method for converting range data of object to model of the object | |
| Zhang et al. | A binary-tree element subdivision method for evaluation of nearly singular domain integrals with continuous or discontinuous kernel | |
| Charton et al. | Mesh repairing using topology graphs | |
| Jalba et al. | Efficient surface reconstruction from noisy data using regularized membrane potentials | |
| Sagawa et al. | Hole filling of a 3D model by flipping signs of a signed distance field in adaptive resolution | |
| Jin et al. | Implicit modeling from polygon soup using convolution | |
| Georgiadis et al. | Indirect all-quadrilateral meshing based on bipartite topological labeling | |
| JP2002352270A (en) | Method for correcting adaptively sampled distance |