"A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons ..."

Timothy M. Chan, Isaac M. Hair (2025)

> Home

Details and statistics

DOI: 10.4230/LIPICS.SOCG.2025.31

access: open

type: Conference or Workshop Paper

metadata version: 2025-06-20

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/compgeom/ChanH25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/compgeom/ChanH25
Timothy M. Chan, Isaac M. Hair:
A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under Translation. SoCG 2025: 31:1-31:16

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.