2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces

Generalizing ham sandwich cuts to equitable subdivisions

SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry

Generalized Balanced Partitions of Two Sets of Points in the Plane

JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry

Geodesic ham-sandwich cuts

SCG '04 Proceedings of the twentieth annual symposium on Computational geometry

Equitable subdivisions within polygonal regions

Computational Geometry: Theory and Applications - Special issue on the Japan conference on discrete and computational geometry 2004

Equal-Area Locus-Based Convex Polygon Decomposition

SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity

Equitable subdivisions within polygonal regions

Computational Geometry: Theory and Applications - Special issue on the Japan conference on discrete and computational geometry 2004

Equal-area locus-based convex polygon decomposition

Theoretical Computer Science

General balanced subdivision of two sets of points in the plane

CJCDGCGT'05 Proceedings of the 7th China-Japan conference on Discrete geometry, combinatorics and graph theory

Finding equitable convex partitions of points in a polygon efficiently

ACM Transactions on Algorithms (TALG)

A stronger conclusion to the classical ham sandwich theorem

European Journal of Combinatorics

Weighted ham-sandwich cuts

JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry

Equipartitions of measures by 2-fans

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation

Equal area polygons in convex bodies

IJCCGGT'03 Proceedings of the 2003 Indonesia-Japan joint conference on Combinatorial Geometry and Graph Theory

Monochromatic geometric k-factors for bicolored point sets with auxiliary points

Information Processing Letters