Computational Geometry Column 44
Computational Geometry
2007-05-23 v1
Authors:
Joseph O'Rourke
Abstract
The open problem of whether or not every pair of equal-area polygons has a hinged dissection is discussed.
Cite
@article{arxiv.cs/0304025,
title = {Computational Geometry Column 44},
author = {Joseph O'Rourke},
journal= {arXiv preprint arXiv:cs/0304025},
year = {2007}
}
Comments
3 pages, 3 figures
Related papers
View all related →
Computational Geometry · Computer Science
Hinged Dissections Exist
Timothy G. Abbott, Zachary Abel, David Charlton, Erik D. Demaine +2
2008-06-12
Computational Geometry · Computer Science
Hinged Kite Mirror Dissection
David Eppstein
2007-05-23
Computational Geometry · Computer Science
Computational Geometry Column 42
Joseph S. B. Mitchell, Joseph O'Rourke
2007-05-23
Computational Geometry · Computer Science
Hinged Dissection of Polyominoes and Polyforms
Erik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson +1
2007-05-23
Computational Geometry · Computer Science
Computational Geometry Column 37
Erik D. Demaine, Joseph O'Rourke
2007-05-23
Computational Geometry · Computer Science
Polyhedral Characterization of Reversible Hinged Dissections
Jin Akiyama, Erik D. Demaine, Stefan Langerman
2020-12-22
Combinatorics · Mathematics
'Congruent Partitions' of Polygons - a Short Introduction
R. Nandakumar
2010-08-03
History and Overview · Mathematics
On Dividing a Rectangle
Robert Dumitru, Quinn Perian, Alexander Nealey, Mohammed Mannan +6
2018-08-21
Metric Geometry · Mathematics
A Set of Questions in Combinatorial and Metric Geometry
R. Nandakumar
2015-02-16
Computational Geometry · Computer Science
An Optimal Algorithm for the Separating Common Tangents of two Polygons
Mikkel Abrahamsen
2015-11-13
Computational Geometry · Computer Science
Common tangents of two disjoint polygons in linear time and constant workspace
Mikkel Abrahamsen, Bartosz Walczak
2018-12-11
Computational Geometry · Computer Science
Circular Separability of Polygons
Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Mariette Yvinec
2016-08-31
Commutative Algebra · Mathematics
Integrality relations for polygonal dissections
Aaron Abrams, Jamie Pommersheim
2024-09-18
Computational Geometry · Computer Science
Covering Polygons by Min-Area Convex Polygons
Elias Dahlhaus, Sariel Har-Peled, Alan L. Hu
2019-12-11
Combinatorics · Mathematics
'Fair' Partitions of Polygons - an Introduction
R. Nandakumar, N. Ramana Rao
2012-08-28
Computational Geometry · Computer Science
Computational Geometry Column 39
Joseph O'Rourke
2007-05-23
Combinatorics · Mathematics
On contractible edges in convex decompositions
Ferran Hurtado, Eduardo Rivera-Campo
2017-09-19
Geometric Topology · Mathematics
The Computational Complexity of Knot and Link Problems
Joel Hass, Jeffrey C. Lagarias, Nicholas Pippenger
2007-05-23
Metric Geometry · Mathematics
Envelopes of $\alpha$-sections
Nicolas Chevallier, Augustin Fruchard, Costin Vîlcu
2015-09-15
Metric Geometry · Mathematics
The Honeycomb Conjecture
Thomas C. Hales
2007-05-23
Computational Geometry · Computer Science
Partitioning Regular Polygons into Circular Pieces I: Convex Partitions
Mirela Damian, Joseph O'Rourke
2026-02-10
Metric Geometry · Mathematics
Noncongruent equidissections of the plane
Dirk Frettlöh
2016-03-31
Computational Geometry · Computer Science
Theorem Discovery Amongst Cyclic Polygons
Philip Todd
2024-01-25
Combinatorics · Mathematics
An obstruction relating locally finite polygons to translation quadrangles
Koen Thas
2014-06-26
Computational Geometry · Computer Science
Closed cap condition under the cap construction algorithm
Mercedes Sandu, Shuyi Weng, Jade Zhang
2024-11-27