NDLI: Review of Computational Geometry: Algorithms and Applications (2nd ed.) by Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf

Please wait, while we are loading the content...

Volume 31, Issue 4, Dec. 2000

The Book Review Column

Reviews of THREE books on Fair Division of Resources

Review of Computational Geometry: Algorithms and Applications (2nd ed.) by Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf

Review of Parameterized Complexity by R. Downey and M. Fellows

Review of: Modern Graph Theory by Béla Bollobás

Review of $A=B^{5}$ by Marko Petkovsek, Herbert S. Wilf, and Doron Zeilberger

Review of Communicating and mobile systems

Reprints from Computing Reviews

NSF Report: Theory of Computing Program

A moment of perfect clarity II

Principles of distributed computing

Computational geometry column 40

Going Backwards

Report on the 6th international meeting on DNA-based computers

Half century of automata theory

Death of a monster

Volume 31, Issue 3, Sept. 2000

Volume 31, Issue 2, June 1 2000

Volume 31, Issue 1, March 2000

Issue 14, January 1972

Issue 13, December 1971

Issue 12, October 1971

Issue 11, August 1971

Issue 10, July 1971

Issue 9, April 1971

Issue 8, January 1971

Issue 7, September 1970

Issue 6, June 1970

Issue 4, January 1970

Issue 3, October 1969

Issue 2, July 1969

Issue 1, April 1969

Review of Computational Geometry: Algorithms and Applications (2nd ed.) by Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf

Content Provider	ACM Digital Library
Author	Masum, Hassan
Abstract	Computational Geometry is a wide-ranging introductory text which exposes readers to the main themes in modern computational geometry. Each chapter introduces a subfield of computational geometry, via natural problems and basic algorithms; exercises and notes help to flesh out the chapter material. This second edition of the book is obviously the product of much effort by the authors, and although some improvements are possible, on the whole this book is worth considering both as a text for a first computational geometry course and as a refresher on basic concepts.Features of interest include:Beginning each chapter with a motivating real-world example, to naturally introduce the algorithms. The solution of this example leads to the key algorithmic idea of the chapter.Emphasis on derivation of algorithms, as opposed to a cookbook-style presentation. The authors often spend a large amount of time to work through several suboptimal solutions for a problem before presenting the final one. While not suitable for the already-knowledgeable practitioner, this gives the far-larger category of students or other less-than-expert readers training in the process of generating new algorithms.Good layout, with wide margins containing intuition-generating diagrams. The Notes and Comments section at the end of each chapter also provides useful orientation to further algorithms and context in each subfield.Wide coverage of algorithms. As the authors say: "In general we have chosen the solution that is most easy to understand and implement. This is not necessarily the most efficient solution. We also took care that the book contains a good mixture of techniques like divide-and-conquer, plane sweep, and randomized algorithms. We decided not to treat all sorts of variations to the problems; we felt it is more important to introduce all main topics in computational geometry than to give more detailed information about a smaller number of topics."
Starting Page	10
Ending Page	12
Page Count	3
File Format	PDF
ISSN	01635700
DOI	10.1145/369836.571192
Journal	ACM SIGACT News (SIGA)
Volume Number	31
Issue Number	4
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1992-06-30
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in