Nothing Special   »   [go: up one dir, main page]

Ogayar et al., 2005 - Google Patents

Point in solid strategies

Ogayar et al., 2005

Document ID
188309385278972177
Author
Ogayar C
Segura R
Feito F
Publication year
Publication venue
Computers & Graphics

External Links

Snippet

Testing whether a point is inside a solid is a basic operation in computer graphics. This document presents a variety of strategies for triangle meshes, a widely used data structure in computer graphics. We discuss some issues about the capabilities of each approach …
Continue reading at www.sciencedirect.com (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/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
    • G06T15/40—Hidden part removal
    • 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
    • G06T11/206—Drawing of charts or graphs
    • 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/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
    • 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
    • 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
    • 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
    • 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
    • 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
    • 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

Similar Documents

Publication Publication Date Title
Ogayar et al. Point in solid strategies
Cignoni et al. Multiresolution modeling and visualization of volume data based on simplicial complexes
Floriani et al. Visibility algorithms on triangulated digital terrain models
US6825839B2 (en) Method and apparatus for generating atomic parts of graphic representation through skeletonization for interactive visualization applications
US7023432B2 (en) Methods, apparatus and computer program products that reconstruct surfaces from data point sets
Agarwal et al. Kinetic binary space partitions for intersecting segments and disjoint triangles
US20080100617A1 (en) Simultaneous simulation of markov chains using quasi-monte carlo techniques
Hege et al. Mathematical visualization: Algorithms, applications and numerics
Shostko et al. Surface triangulation over intersecting geometries
Fellegara et al. Terrain trees: a framework for representing, analyzing and visualizing triangulated terrains
Li et al. Fast and robust GPU-based point-in-polyhedron determination
Beneš et al. Efficient methods to visualize finite element meshes
JP2010501100A (en) Simultaneous simulation of Markov chains using the quasi-Monte Carlo method
Danovaro et al. Level-of-detail for data analysis and exploration: A historical overview and some new perspectives
Qin et al. Research and application of Boolean operation for triangular mesh model of underground space engineering—Boolean operation for triangular mesh model
Lagae et al. Geometry synthesis by example
Horvat et al. Ray-casting point-in-polyhedron test
Figueiredo et al. A survey on collision detection techniques for virtual environments
Li et al. Efficient ray casting polygonized isosurface of binary volumes
Khamayseh et al. Use of the spatial kD-tree in computational physics applications
OOSTEROM A modified binary space partitioning tree for geographic information systems
Crosnier et al. Tribox bounds for three-dimensional objects
de Berg et al. Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions
Jiménez et al. Particle Oriented Collision Detection using Simplicial Coverings and Tetra‐Trees
Berk et al. Direct volume rendering of unstructured grids