Algorithms and Lower Bounds for the Maximum Overlap of Two Polygons Under Translation

Documenti analoghi

• Computing Non-Obtuse Triangulations with Few Steiner Points
  di: Abrahamsen, Mikkel, et al.
  Pubblicazione: (2025)
• Compatible Triangulations of Simple Polygons
  di: Afshani, Peyman, et al.
  Pubblicazione: (2026)
• Minimum Star Partitions of Simple Polygons in Polynomial Time
  di: Abrahamsen, Mikkel, et al.
  Pubblicazione: (2023)
• Geometric spanners of bounded tree-width
  di: Buchin, Kevin, et al.
  Pubblicazione: (2024)
• Transforming Dogs on the Line: On the Fréchet Distance Under Translation or Scaling in 1D
  di: Blank, Lotte, et al.
  Pubblicazione: (2025)