Ray Shooting, Depth Orders and Hidden Surface Removal

Mark De Berg

ISBN 10: 3540570209 / ISBN 13: 9783540570202

Published by Springer, Springer, 1993

About this Item

Druck auf Anfrage Neuware - Printed after ordering - Computational geometry is the part of theoretical computerscience that concerns itself with geometrical objects; itaims to define efficient algorithms for problems involvingpoints, lines, polygons, and so on. The field has gainedpopularity very rapidly during the last decade. This ispartly due to the many application areas of computationalgeometry and partly due to the beauty of the field itself.This monograph focuses on three problems that arise inthree-dimensional computational geometry. The first problemis the ray shooting problem: preprocess a set of polyhedrainto a data structure such that the first polyhedron that ishit by a query ray can be determined quickly. The secondproblem is that of computing depth orders: we want to sort aset of polyhedra such thatif one polyhedron is (partially)obscured by another polyhedron then it comes first in theorder. The third problem is the hidden surface removalproblem: given a set of polyhedra and a view point, computewhich parts of the polyhedra are visible from the viewpoint. These three problems involve issues that arefundamental to three-dimensional computational geometry.The book also contains a large introductory part discussingthe techniques used to tackle the problems. This part shouldinterest not only those who need the background for the restof the book but also anyone who wants to know more aboutsome recent techniques in computational geometry.

Seller Inventory # 9783540570202

Bibliographic Details

• Title: Ray Shooting, Depth Orders and Hidden Surface Removal
• Publisher: Springer, Springer
• Publication Date: 1993
• Language: English
• ISBN 10: 3540570209
• ISBN 13: 9783540570202
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 13D millimeters 235 millimeters width by 155 millimeters height by 13 millimeters depth
• Weight: 341 grams

About this title

Synopsis

Computational geometry is the part of theoretical computer science that concerns itself with geometrical objects; it aims to define efficient algorithms for problems involving points, lines, polygons, and so on. The field has gained popularity very rapidly during the last decade. This is partly due to the many application areas of computational geometry and partly due to the beauty of the field itself. This monograph focuses on three problems that arise in three-dimensional computational geometry. The first problem is the ray shooting problem: preprocess a set of polyhedra into a data structure such that the first polyhedron that is hit by a query ray can be determined quickly. The second problem is that of computing depth orders: we want to sort a set of polyhedra such thatif one polyhedron is (partially) obscured by another polyhedron then it comes first in the order. The third problem is the hidden surface removal problem: given a set of polyhedra and a view point, compute which parts of the polyhedra are visible from the view point. These three problems involve issues that are fundamental to three-dimensional computational geometry. The book also contains a large introductory part discussing the techniques used to tackle the problems. This part should interest not only those who need the background for the rest of the book but also anyone who wants to know more about some recent techniques in computational geometry.