Amazon cover image
Image from Amazon.com
Image from Google Jackets

Efficient Structures for Geometric Data Management [electronic resource] / edited by Oliver Günther.

Contributor(s): Material type: TextTextSeries: Lecture Notes in Computer Science ; 337Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1988Description: XIV, 138 p. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540460077
Subject(s): Additional physical formats: Printed edition:: No titleDDC classification:
  • 005.1 23
LOC classification:
  • QA76.9.A43
Online resources:
Contents:
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.
In: Springer eBooksSummary: 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.
Item type: E-BOOKS
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
Home library Call number Materials specified URL Status Date due Barcode
IMSc Library Link to resource Available EBK5662

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.

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.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India