A Quadratic Time Algorithm for The MinMax Length Triangulation (Extended Abstract)
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/focs/EdelsbrunnerT91
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/focs/EdelsbrunnerT91
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Herbert_Edelsbrunner
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Tiow_Seng_Tan
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FSFCS.1991.185400
>
foaf:
homepage
<
https://doi.org/10.1109/SFCS.1991.185400
>
dc:
identifier
DBLP conf/focs/EdelsbrunnerT91
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FSFCS.1991.185400
(xsd:string)
dcterms:
issued
1991
(xsd:gYear)
rdfs:
label
A Quadratic Time Algorithm for The MinMax Length Triangulation (Extended Abstract)
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Herbert_Edelsbrunner
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Tiow_Seng_Tan
>
swrc:
pages
414-423
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/focs/FOCS32
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/focs/EdelsbrunnerT91/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/focs/EdelsbrunnerT91
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/focs/focs91.html#EdelsbrunnerT91
>
rdfs:
seeAlso
<
https://doi.org/10.1109/SFCS.1991.185400
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/focs
>
dc:
subject
arbitrary normed metrics, quadratic time algorithm, minmax length triangulation, triangulation, maximum edge length, relative neighborhood graph
(xsd:string)
dc:
title
A Quadratic Time Algorithm for The MinMax Length Triangulation (Extended Abstract)
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document