Normal view MARC view ISBD view

Computational geometry in C /Joseph O'Rourke

By: Joseph O'RourkeContributor(s): Joseph O'RourkeMaterial type: Text

TextPublisher number: Variety Books Publishers Distributors | ;B-10,Street No-02,West Vinod Nagar ,Delhi-110092Publication details: Cambridge, UK ; New York, NY, USA : Cambridge University Press , 1998Description: xiii, 376 pages : illustrations ; 26 cmISBN: 9780521649766Subject(s): C (Computer program language)Genre/Form: Geometry -- Data processing.DDC classification: 516.02855 ROU

Contents:

Polygon triangulation -- Polygon partitioning -- Convex hulls in two dimensions -- Convex hulls in three dimensions -- Voronoi diagrams -- Arrangements -- Search and intersection -- Motion planning.

Summary: This is the newly revised and expanded edition of a popular introduction to the design and implementation of geometry algorithms arising in areas such as computer graphics, robotics, and engineering design. The basic techniques used in computational geometry are all covered: polygon triangulations, convex hulls, Voronoi diagrams, arrangements, geometric searching, and motion planning. The self-contained treatment presumes only an elementary knowledge of mathematics, but reaches topics on the frontier of current research, making it a useful reference for practitioners at all levels. The second edition contains material on several new topics, such as randomized algorithms for polygon triangulation, planar point location, 3D convex hull construction, intersection algorithms for ray-segment and ray-triangle, and point-in-polyhedron.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 2 )
Title notes ( 2 )
Comments ( 0 )

Holdings
Item type	Current library	Call number	Status	Date due	Barcode	Item holds
Books	SNU LIBRARY	516.02855 ROU (Browse shelf(Opens below))	Not For Loan		27015
Books	SNU LIBRARY	516.02855 ROU (Browse shelf(Opens below))	Available		27016

Total holds: 0

Browsing SNU LIBRARY shelves Close shelf browser (Hides shelf browser)

Previous								Next
Previous	516.002 BER Computational geometry	516.00934 SAR Geometry in ancient and medieval India	516.02854 PRE Computational geometry	516.02855 ROU Computational geometry in C	516.02855 ROU Computational geometry in C	516.04 MUN Analysis on manifolds.	516.07 TU An introduction to manifolds.	Next

Polygon triangulation --
Polygon partitioning --
Convex hulls in two dimensions --
Convex hulls in three dimensions --
Voronoi diagrams --
Arrangements --
Search and intersection --
Motion planning.

This is the newly revised and expanded edition of a popular introduction to the design and implementation of geometry algorithms arising in areas such as computer graphics, robotics, and engineering design. The basic techniques used in computational geometry are all covered: polygon triangulations, convex hulls, Voronoi diagrams, arrangements, geometric searching, and motion planning. The self-contained treatment presumes only an elementary knowledge of mathematics, but reaches topics on the frontier of current research, making it a useful reference for practitioners at all levels. The second edition contains material on several new topics, such as randomized algorithms for polygon triangulation, planar point location, 3D convex hull construction, intersection algorithms for ray-segment and ray-triangle, and point-in-polyhedron.

There are no comments on this title.

to post a comment.