[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Aichholzer et al., 2009 - Google Patents

Recovering structure from r‐sampled objects

Aichholzer et al., 2009

View PDF
Document ID
12783036819156485688
Author
Aichholzer O
Aurenhammer F
Kornberger B
Plantinga S
Rote G
Sturm A
Vegter G
Publication year
Publication venue
Computer Graphics Forum

External Links

Snippet

For a surface in 3‐space that is represented by a set S of sample points, we construct a coarse approximating polytope P that uses a subset of S as its vertices and preserves the topology of. In contrast to surface reconstruction we do not use all the sample points, but we …
Continue reading at core.ac.uk (PDF) (other versions)

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50Computer-aided design
    • G06F17/5009Computer-aided design using simulation
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for programme control, e.g. control unit
    • G06F9/06Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46Multiprogramming arrangements
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30Information retrieval; Database structures therefor; File system structures therefor
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T17/00Three dimensional [3D] modelling, e.g. data description of 3D objects
    • G06T17/20Finite element generation, e.g. wire-frame surface description, tesselation
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10Complex mathematical operations
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06QDATA 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/00Administration; Management
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06KRECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K9/00Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
    • G06K9/36Image preprocessing, i.e. processing the image information without deciding about the identity of the image
    • G06K9/46Extraction of features or characteristics of the image
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F3/00Input 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
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T11/002D [Two Dimensional] image generation
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00Digital computers in general; Data processing equipment in general
    • G06F15/16Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes

Similar Documents

Publication Publication Date Title
Aleksandrov et al. Determining approximate shortest paths on weighted polyhedral surfaces
Marco et al. Exact 3D boundary representation in finite element analysis based on Cartesian grids independent of the geometry
US8442805B2 (en) Efficient computation of Voronoi diagrams of general generators in general spaces and uses thereof
Sousbie et al. ColDICE: A parallel Vlasov–Poisson solver using moving adaptive simplicial tessellation
Jiao et al. Reconstructing high-order surfaces for meshing
Sheffer et al. Smoothing an overlay grid to minimize linear distortion in texture mapping
Váša et al. Mesh statistics for robust curvature estimation
Yang et al. Generalized discrete Ricci flow
Feng et al. Multiscale geometric modeling of macromolecules II: Lagrangian representation
Herholz et al. Diffusion diagrams: Voronoi cells and centroids from diffusion
Chen et al. Localizing the delaunay triangulation and its parallel implementation
Kommu A validation of causal dynamical triangulations
Zhao et al. Progressive discrete domains for implicit surface reconstruction
Perego et al. MODA: a new algorithm to compute optical depths in multidimensional hydrodynamic simulations
Aichholzer et al. Recovering structure from r‐sampled objects
Sugihara Three-dimensional convex hull as a fruitful source of diagrams
Lee et al. Representing thermal vibrations and uncertainty in molecular surfaces
Shuai et al. GPU-based computation of discrete periodic centroidal Voronoi tessellation in hyperbolic space
Aubry et al. Boundary layer mesh generation on arbitrary geometries
Li et al. An algorithm for filling complex holes in reverse engineering
Sheehy An Output-Sensitive Algorithm for Computing Weighted α-Complexes.
Luo et al. Construction of near optimal meshes for 3D curved domains with thin sections and singularities for p-version method
Xin et al. Parallel computing 2D Voronoi diagrams using untransformed sweepcircles
Qian et al. Reconstruction of surfaces of revolution with partial sampling
Benkert et al. Approximate one-to-one point pattern matching