Problem of Cutting a Polygon into Two Congruent Parts

In the paper, we discuss a version of the classical problem of partitioning a figure into two congruent parts, which was posed in 1999. We consider the conjecture that when partitioning a convex centrally symmetric figure into two congruent parts, the center of symmetry always lies on the common boundary of the two parts. The main result of the paper consists in proving the conjecture for simple but not necessarily convex figures on the plane under the condition that the figure is partitioned into two parts by a curve that is not self-intersecting. There is a certain advance in classifying the types of motions in the general case on the plane.

Authors

Institutions

Publication Details

Journal
Mathematical Notes
Published
2025-04-01
DOI
https://doi.org/10.1134/s0001434625030101
Primary Topic
Optimization and Packing Problems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Problem of Cutting a Polygon into Two Congruent Parts

A. Yu. Sadovnichii
Mathematical Notes
Optimization and Packing Problems
article

Problem of Cutting a Polygon into Two Congruent Parts

A. Yu. Sadovnichii
article en

Abstract

In the paper, we discuss a version of the classical problem of partitioning a figure into two congruent parts, which was posed in 1999. We consider the conjecture that when partitioning a convex centrally symmetric figure into two congruent parts, the center of symmetry always lies on the common boundary of the two parts. The main result of the paper consists in proving the conjecture for simple but not necessarily convex figures on the plane under the condition that the figure is partitioned into two parts by a curve that is not self-intersecting. There is a certain advance in classifying the types of motions in the general case on the plane.

Mathematical NotesVol. 117(3-4)
Moscow Institute of Physics and Technology (RU), Moscow Power Engineering Institute (RU), Moscow Aviation Institute (RU)
Openalex Percentile: Top 81%
Optimization and Packing Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.