"Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized ..."

Da Wei Zheng, Jack Spalding-Jamieson, Brandon Zhang (2020)

> Home

Details and statistics

DOI: 10.4230/LIPICS.SOCG.2020.83

access: open

type: Conference or Workshop Paper

metadata version: 2021-11-09

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/compgeom/ZhengSZ20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/compgeom/ZhengSZ20
Da Wei Zheng, Jack Spalding-Jamieson, Brandon Zhang:
Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge). SoCG 2020: 83:1-83:7

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.