"An O(n) Algorithm to Find a Near-Optimum Partition of a Convex Polygon."

T. C. Hu, M. T. Shing (1981)

> Home

Details and statistics

DOI: 10.1016/0196-6774(81)90014-6

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jal/HuS81
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/HuS81
T. C. Hu, M. T. Shing:
An O(n) Algorithm to Find a Near-Optimum Partition of a Convex Polygon. J. Algorithms 2(2): 122-138 (1981)

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.