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

Andrzej Lingas, Valeriu Soltan (1998)

> Home

Details and statistics

DOI: 10.1007/S002240000101

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mst/LingasS98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/LingasS98
Andrzej Lingas, Valeriu Soltan:
Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions. Theory Comput. Syst. 31(5): 507-538 (1998)

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.