Amazon cover image
Image from Amazon.com

Efficient structures for geometric data management / Oliver Günther.

By: Günther, Oliver, 1961-Material type: TextTextSeries: Serienbezeichnung | Lecture notes in computer science ; 337.Publisher: Berlin ; New York : Springer-Verlag, ©1988Description: 1 online resource (xi, 135 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540460077; 3540460071Subject(s): Data structures (Computer science) | Database management | Structures de données (Informatique) | Bases de données -- Gestion | Data structures (Computer science) | Database management | Geometrieverarbeitung | base de données -- gestion -- structure de donnéesGenre/Form: Electronic books. Additional physical formats: Print version:: Efficient structures for geometric data management.DDC classification: 005.7/3 LOC classification: QA76.9.D35 | G86 1988Other classification: 54.64 | 54.73 | *68P05 | 51-04 | 68-02 | 68U99 | 28 Online resources: Click here to access online
Contents:
Introduction -- Operators and Representation Schemes for Geometric Data -- Polyhedral Chains -- A Dual Approach to Detect Polyhedral Intersections in Arbitrary Dimensions -- The Cell Tree: An Index for Geometric Databases -- The Arc Tree: An Approximation Scheme to Represent Arbitrary Curved Shapes -- Conclusions -- References.
Action note: digitized 2010 committed to preserveSummary: The efficient management of geometric data, such as points, curves, or polyhedra in arbitrary dimensions, is of great importance in many complex database applications like CAD/CAM, robotics, or computer vision. To provide optimal support for geometric operations, it is crucial to choose efficient data representation schemes. The first part of this book contains a taxonomy and critical survey of common operations and representation schemes for geometric data. Then several new schemes for the efficient support of set operations (union, intersection) and search operations (point location, range search) are presented.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

Includes bibliographical references (pages 127-135).

Use copy Restrictions unspecified star MiAaHDL

Electronic reproduction. [Place of publication not identified] : HathiTrust Digital Library, 2010. MiAaHDL

Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. MiAaHDL

http://purl.oclc.org/DLF/benchrepro0212

digitized 2010 HathiTrust Digital Library committed to preserve pda MiAaHDL

Print version record.

Introduction -- Operators and Representation Schemes for Geometric Data -- Polyhedral Chains -- A Dual Approach to Detect Polyhedral Intersections in Arbitrary Dimensions -- The Cell Tree: An Index for Geometric Databases -- The Arc Tree: An Approximation Scheme to Represent Arbitrary Curved Shapes -- Conclusions -- References.

The efficient management of geometric data, such as points, curves, or polyhedra in arbitrary dimensions, is of great importance in many complex database applications like CAD/CAM, robotics, or computer vision. To provide optimal support for geometric operations, it is crucial to choose efficient data representation schemes. The first part of this book contains a taxonomy and critical survey of common operations and representation schemes for geometric data. Then several new schemes for the efficient support of set operations (union, intersection) and search operations (point location, range search) are presented.

Powered by Koha