Asiler et al., 2024 - Google Patents
KerGen: a kernel computation algorithm for 3D polygon meshesAsiler et al., 2024
View PDF- Document ID
- 15627144913476998400
- Author
- Asiler M
- Sahillioğlu Y
- Publication year
- Publication venue
- Computer Graphics Forum
External Links
Snippet
We compute the kernel of a shape embedded in 3D as a polygon mesh, which is defined as the set of all points that have a clear line of sight to every point of the mesh. The KerGen algorithm, short for Kernel Generation, employs efficient plane‐plane and line‐plane …
- 238000004422 calculation algorithm 0 title abstract description 71
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/30587—Details of specialised database models
-
- 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
-
- 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
- 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
- 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
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
-
- 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
- G06T7/00—Image analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
- G06K9/62—Methods or arrangements for recognition using electronic means
- G06K9/6267—Classification techniques
- G06K9/6268—Classification techniques relating to the classification paradigm, e.g. parametric or non-parametric approaches
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
- G06K9/36—Image preprocessing, i.e. processing the image information without deciding about the identity of the image
- G06K9/46—Extraction of features or characteristics of the image
-
- 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
- G06T11/00—2D [Two Dimensional] image generation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F1/00—Details of data-processing equipment not covered by groups G06F3/00 - G06F13/00, e.g. cooling, packaging or power supply specially adapted for computer application
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T13/00—Animation
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Fortune | Voronoi diagrams and Delaunay triangulations | |
Chang et al. | Fast oriented bounding box optimization on the rotation group SO (3, ℝ) | |
McLoughlin et al. | Over two decades of integration‐based, geometric flow visualization | |
Khatamian et al. | Survey on 3D surface reconstruction | |
US8665267B2 (en) | System and method for generating 3D surface patches from unconstrained 3D curves | |
Klein et al. | Point cloud collision detection | |
Melvær et al. | Geodesic polar coordinates on polygonal meshes | |
Herholz et al. | Diffusion diagrams: Voronoi cells and centroids from diffusion | |
Leymarie et al. | The medial scaffold of 3D unorganized point clouds | |
Alliez et al. | CGAL: the computational geometry algorithms library | |
Xiao et al. | Coupling point cloud completion and surface connectivity relation inference for 3D modeling of indoor building environments | |
Hofmann et al. | Visualization of 4D vector field topology | |
Zint et al. | Feature‐Preserving Offset Mesh Generation from Topology‐Adapted Octrees | |
Asiler et al. | KerGen: a kernel computation algorithm for 3D polygon meshes | |
Kaul | Computing Minkowski sums | |
Kyung et al. | Robust polyhedral Minkowski sums with GPU implementation | |
Zimmer et al. | Efficient computation of shortest path-concavity for 3D meshes | |
Knapp | A space-filling curve for pyramidal adaptive mesh refinement | |
Khamayseh et al. | Deterministic point inclusion methods for computational applications with complex geometry | |
Wang et al. | Robust computation of 3D Apollonius diagrams | |
Bukenberger et al. | Constructing L∞ Voronoi Diagrams in 2D and 3D | |
Nærland | Geometry decomposition algorithms for the Nitsche method on unfitted geometries | |
Klein et al. | Interpolation search for point cloud intersection | |
Pujol et al. | Triangle influence supersets for fast distance computation | |
Luo et al. | Fast self-repairing region growing surface reconstruction algorithm for unorganised point cloud data |