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

Benouamer et al., 1993 - Google Patents

Error-free boundary evaluation using lazy rational arithmetic: a detailed implementation

Benouamer et al., 1993

View PDF
Document ID
1401785308089858356
Author
Benouamer M
Michelucci D
Peroche B
Publication year
Publication venue
Proceedings on the second ACM symposium on Solid modeling and applications

External Links

Snippet

A new bounda~ evaluation method is presetied It is based on error-free Boolean operations on polyhedral solids. We descn” be, in detail, art intersection atgorithm that handles on a straigi@ orward way, & the possibk geometric cases. We also describe a general data …
Continue reading at dl.acm.org (PDF) (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
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30587—Details of specialised database models
    • G06F17/30592—Multi-dimensional databases and data warehouses, e.g. MOLAP, ROLAP
    • 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
    • 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/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G06F17/30958—Graphs; Linked lists
    • 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/10—Complex mathematical operations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled

Similar Documents

Publication Publication Date Title
Houghton et al. Implementation of a divide-and-conquer method for intersection of parametric surfaces
Tsao et al. A parallel thinning algorithm for 3-D pictures
Alt et al. Approximate matching of polygonal shapes
Hamann Curvature approximation for triangulated surfaces
Hershberger Finding the visibility graph of a simple polygon in time proportional to its size
Dobkin et al. Computational geometry in a curved world
Agarwal Intersection and decomposition algorithms for planar arrangements
Benouamer et al. Error-free boundary evaluation using lazy rational arithmetic: a detailed implementation
Dey et al. Computing homology groups of simplicial complexes in R 3
Barki et al. Exact, robust, and efficient regularized Booleans on general 3D meshes
Keyser et al. Efficient and exact manipulation of algebraic points and curves
Pach et al. Combinatorial geometry and its algorithmic applications: The Alcalá lectures
Segal et al. Partitioning polyhedral objects into nonintersecting parts
Amenta Bounded boxes, Hausdorff distance, and a new proof of an interesting Helly-type theorem
Keyser et al. Efficient and accurate B-rep generation of low degree sculptured solids using exact arithmetic
Xu et al. Fast and robust Booleans on polyhedra
Kubicka et al. Using graph distance in object recognition
Kuo et al. A new combinatorial approach to surface reconstruction with sharp features
Duminil-Copin Sharp threshold phenomena in statistical physics
Wang et al. Robust computation of 3D Apollonius diagrams
Bühler et al. Reliable distance and intersection computation using finite precision geometry
Davari et al. The convex hull of finitely generable subsets and its predicate transformer
Franklin et al. Data Structures for Parallel Spatial Algorithms on Large Datasets (Vision paper)
Gowda Dynamic problems in computational geometry
Sternal et al. Robust Modeling of Polyhedral Space Partitions