"A new O(n*log n) algorithm for computing the intersection of convex polygons."

Sukhamay Kundu (1987)

> Home

Details and statistics

DOI: 10.1016/0031-3203(87)90067-7

access: closed

type: Journal Article

metadata version: 2020-02-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/pr/Kundu87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pr/Kundu87
Sukhamay Kundu:
A new O(n*log n) algorithm for computing the intersection of convex polygons. Pattern Recognit. 20(4): 419-424 (1987)

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.