Equidecomposable quadratic regions

Authors:
Thomas C. Hales
Affiliations:
Math Department, University of Pittsburgh, Pittsburgh, PA
Venue:
ADG'06 Proceedings of the 6th international conference on Automated deduction in geometry
Year:
2006

Citing 2
Cited 0

Computational real algebraic geometry

Handbook of discrete and computational geometry
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)

Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article describes an algorithm that decides whether a region in three dimensions, described by quadratic constraints, is equidecomposable with a collection of primitive regions. When a decomposition exists, the algorithm finds the volume of the given region. Applications to the 'Flyspeck' project are discussed.