The complexity of cutting complexes View on Open Library

The complexity of cutting complexes

by B. Chazelle

No reviews yet
First published: 1987 1 language
Subjects
Combinatorial geometry Convex polytopes Data processing

Reviews

Log in or sign up to write a review.

No reviews yet. Be the first!

More by B. Chazelle

An algorithm for generalized point location and its applications

An algorithm for generalized point locat...

L'algorithmique et des sciences

L'algorithmique et des sciences

Le Livre en Franche Comté

Le Livre en Franche Comté

An optimal algorithm for intersecting line segments in the plane

An optimal algorithm for intersecting li...

Advances in discrete and computational geometry

Advances in discrete and computational g...

You Might Also Like

More in Combinatorial geomet...
Handbook of discrete and computational geometry

Handbook of discrete and computational g...

Joseph O'Rourke
The pursuit of perfect packing

The pursuit of perfect packing

Tomaso Aste
A Mathematical Tapestry

A Mathematical Tapestry

Peter Hilton
Surfaces and planar discontinuous groups

Surfaces and planar discontinuous groups

Heiner Zieschang
Finite Geometries

Finite Geometries

Gyorgy Kiss
Twists, Tilings, and Tessellations

Twists, Tilings, and Tessellations

Robert J. Lang