"Computing Low-Cost Convex Partitions for Planar Point Sets Based on a ..."

Laurent Moalic et al. (2020)

> Home

Details and statistics

DOI: 10.4230/LIPICS.SOCG.2020.84

access: open

type: Conference or Workshop Paper

metadata version: 2021-06-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/compgeom/MoalicSLK20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/compgeom/MoalicSLK20
Laurent Moalic, Dominique Schmitt, Julien Lepagnot, Julien Kritter:
Computing Low-Cost Convex Partitions for Planar Point Sets Based on a Memetic Approach (CG Challenge). SoCG 2020: 84:1-84:9

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.