Algorithms in Combinatorial Geometry.
Jacob E. Goodman, Herbert Edelsbrunner
Abstract
Jacob E. Goodman, Herbert Edelsbrunner
Abstract
This book offers a modern approach to computational geo- metry, an area thatstudies the computational complexity of geometric problems. Combinatorial investigations play an important role in this study.
OpenAlex reports 1811 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This book offers a modern approach to computational geo- metry, an area thatstudies the computational complexity of geometric problems. Combinatorial investigations play an important role in this study.
Key concepts: Geometry, Discrete geometry, Computer science, Mathematics