1995•Lecture notes in computer scienceRequires access

On the complexity of approximating and illuminating three-dimensional convex polyhedra

Gautam Das, Michael T. Goodrich

Open publisher page 12 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 12 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.

Key concepts: Polyhedron, Regular polygon, Convex polytope, Triangulation, Computer science, Computational complexity theory, Computational geometry, Planar

Back to paper search Browse research topics Original source

On the complexity of approximating and illuminating three-dimensional convex polyhedra — Research Paper | ScholarLens