"Computing the Link Center of a Simple Polygon."

William J. Lenhart et al. (1988)

> Home

Details and statistics

DOI: 10.1007/BF02187913

access: open

type: Journal Article

metadata version: 2022-09-20

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dcg/LenhartPSSSSTWY88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dcg/LenhartPSSSSTWY88
William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap:
Computing the Link Center of a Simple Polygon. Discret. Comput. Geom. 3: 281-293 (1988)

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.