[go: up one dir, main page]

Toussaint et al., 1982 - Google Patents

On a convex hull algorithm for polygons and its application to triangulation problems

Toussaint et al., 1982

Document ID
13817104016021655670
Author
Toussaint G
Avis D
Publication year
Publication venue
Pattern Recognition

External Links

Snippet

A frequently used algorithm for finding the convex hull of a simple polygon in linear running time has been recently shown to fail in some cases. Due to its simplicity the algorithm is, nevertheless, attractive. In this paper it is shown that the algorithm does in fact work for a …
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/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/10—Complex mathematical operations
    • 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
    • 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
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00—Data processing: database and file management or data structures
    • Y10S707/99941—Database schema or data structure
    • Y10S707/99942—Manipulating data structure, e.g. compression, compaction, compilation
    • 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

Similar Documents

Publication Publication Date Title
Toussaint et al. On a convex hull algorithm for polygons and its application to triangulation problems
Dobkin et al. Determining the separation of preprocessed polyhedra—a unified approach
Nielson et al. Computing the separating surface for segmented data
Chazelle et al. Lines in space: Combinatorics and algorithms
Kozminski et al. Rectangular dualization and rectangular dissections
Wu et al. Improvements to algorithms for computing the Minkowski sum of 3-polytopes
Bieri Nef polyhedra: A brief introduction
Rossignac BLIST: A Boolean list formulation of CSG trees
Licklider A picture is worth a thousand words: and it costs...
Królak A proof of the cosmic censorship hypothesis
Conkey et al. Using isosurface methods for visualizing the envelope of a swept trivariate solid
Rodrıguez et al. Fast neighborhood operations for images and volume data sets
Di Battista et al. Embedding problems for paths with direction constrained edges
Asano et al. Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region
Feito et al. Boolean representation of general planar polygons
Abam et al. Kinetic collision detection for convex fat objects
Yu et al. On the application of cellular automata to image thinning with cellular neural network
Sharir Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications
Dévai On the complexity of some geometric intersection problems
Rao et al. Shape description from imperfect and incomplete data
Bokka et al. Optimal algorithms for the multiple query problem on reconfigurable meshes, with applications
Laszlo Techniques for visualizing 3-dimensional manifolds
Rappoport An efficient adaptive algorithm for constructing the convex differences tree of a simple polygon
Dehne Computational geometry and VLSI
Eppstein Fully dynamic maintenance of euclidean minimum spanning trees