"Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions."

Andrzej Lingas, Valeriu Soltan (1996)

> Home

Details and statistics

DOI: 10.1007/BFB0009508

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isaac/LingasS96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/LingasS96
Andrzej Lingas, Valeriu Soltan:
Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions. ISAAC 1996: 315-325

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.