|
![]() |
|||
|
||||
OverviewThis book offers a modern approach to computational geo-metry, an area thatstudies the computational complexity ofgeometric problems. Combinatorial investigations play animportant role in this study. Full Product DetailsAuthor: Herbert EdelsbrunnerPublisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K Edition: 1987 ed. Volume: 10 Dimensions: Width: 15.50cm , Height: 2.50cm , Length: 23.50cm Weight: 1.760kg ISBN: 9783540137221ISBN 10: 354013722 Pages: 423 Publication Date: 31 July 1987 Audience: College/higher education , Professional and scholarly , Undergraduate , Postgraduate, Research & Scholarly Format: Hardback Publisher's Status: Active Availability: Out of print, replaced by POD ![]() We will order this item for you from a manufatured on demand supplier. Table of ContentsI Combinatorial Geometry.- 1 Fundamental Concepts in Combinatorial Geometry.- 2 Permutation Tables.- 3 Semispaces of Configurations.- 4 Dissections of Point Sets.- 5 Zones in Arrangements.- 6 The Complexity of Families of Cells.- II Fundamental Geometric Algorithms.- 7 Constructing Arrangements.- 8 Constructing Convex Hulls.- 9 Skeletons in Arrangements.- 10 Linear Programming..- 11 Planar Point Location Search.- III Geometric and Algorithmic Applications.- 12 Problems for Configurations and Arrangements.- 13 Voronoi Diagrams.- 14 Separation and Intersection in the Plane.- 15 Paradigmatic Design of Algorithms.- References.- Appendix A Definitions.- Appendix B Notational Conventions.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |