Остановите войну!
for scientists:
default search action
Robert L. Scot Drysdale
Publications
- 2008
- [j23]Robert L. Scot Drysdale, Günter Rote, Astrid Sturm:
Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs. Comput. Geom. 41(1-2): 31-47 (2008) - [j22]Robert L. Scot Drysdale, Asish Mukhopadhyay:
An O(nlogn) algorithm for the all-farthest-segments problem for a planar set of points. Inf. Process. Lett. 105(2): 47-51 (2008) - 2006
- [j21]Franz Aurenhammer, Robert L. Scot Drysdale, Hannes Krasser:
Farthest line segment Voronoi diagrams. Inf. Process. Lett. 100(6): 220-225 (2006) - [c15]Asish Mukhopadhyay, Robert L. Scot Drysdale:
An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of Points. CCCG 2006 - 2002
- [j19]Gill Barequet, Matthew T. Dickerson, Robert L. (Scot) Drysdale III:
2-Point site Voronoi diagrams. Discret. Appl. Math. 122(1-3): 37-54 (2002) - 2001
- [j17]Robert L. (Scot) Drysdale III, Scott A. McElfresh, Jack Snoeyink:
On exclusion regions for optimal triangulations. Discret. Appl. Math. 109(1-2): 49-65 (2001) - [c11]Gill Barequet, Robert L. Scot Drysdale, Matthew Dickerson, David S. Guertin:
2-point site Voronoi diagrams. SCG 2001: 323-324 - 1999
- [c10]Gill Barequet, Matthew Dickerson, Robert L. (Scot) Drysdale III:
2-Point Site Voronoi Diagrams. WADS 1999: 219-230 - 1997
- [j14]Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl:
Fast Greedy Triangulation Algorithms. Comput. Geom. 8: 67-86 (1997) - 1994
- [c8]Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl:
Fast Greedy Triangulation Algorithms. SCG 1994: 211-220 - 1992
- [j12]Matthew Dickerson, Robert L. (Scot) Drysdale III, Jörg-Rüdiger Sack:
Simple algorithms for enumerating interpoint distances and finding $k$ nearest neighbors. Int. J. Comput. Geom. Appl. 2(3): 221-239 (1992) - 1991
- [c6]Matthew Dickerson, Robert L. (Scot) Drysdale III:
Enumerating k Distances for n Points in the Plane. SCG 1991: 234-238 - 1990
- [j11]Matthew Dickerson, Robert L. (Scot) Drysdale III:
Fixed-Radius Near Neighbors Search Algorithms for Points and Segments. Inf. Process. Lett. 35(5): 269-273 (1990) - 1986
- [j4]Bernard Chazelle, Robert L. (Scot) Drysdale III, D. T. Lee:
Computing the Largest Empty Rectangle. SIAM J. Comput. 15(1): 300-315 (1986) - 1985
- [j3]James E. Boyce, David P. Dobkin, Robert L. (Scot) Drysdale III, Leonidas J. Guibas:
Finding Extremal Polygons. SIAM J. Comput. 14(1): 134-147 (1985) - [c3]L. Paul Chew, Robert L. (Scot) Drysdale III:
Voronoi diagrams based on convex distance functions. SCG 1985: 235-244 - 1984
- [c2]Bernard Chazelle, Robert L. (Scot) Drysdale III, D. T. Lee:
Computing the Largest Empty Rectangle. STACS 1984: 43-54 - 1982
- [c1]James E. Boyce, David P. Dobkin, Robert L. (Scot) Drysdale III, Leonidas J. Guibas:
Finding Extremal Polygons. STOC 1982: 282-289 - 1981
- [j2]D. T. Lee, Robert L. (Scot) Drysdale III:
Generalization of Voronoi Diagrams in the Plane. SIAM J. Comput. 10(1): 73-87 (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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-09-28 03:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint