1989American Mathematical MonthlyRequires access

Algorithms in Combinatorial Geometry.

Jacob E. Goodman, Herbert Edelsbrunner

Open publisher page 1,811 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 1811 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Geometry, Discrete geometry, Computer science, Mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
Algorithms in Combinatorial Geometry. — Research Paper | ScholarLens