(Q54310199)

English

Euclidean minimum spanning trees and bichromatic closest pairs

journal article from 'Discrete & Computational Geometry' published in 1991

In more languages

edit

Statements

instance of

scholarly article

0 references

title

Euclidean minimum spanning trees and bichromatic closest pairs (English)

0 references

2

Herbert Edelsbrunner

0 references

Emo Welzl

series ordinal

4

object named as

Emo Welzl

0 references

Pankaj K. Agarwal

series ordinal

1

object named as

Pankaj K. Agarwal

0 references

author name string

Otfried Schwarzkopf

series ordinal

3

0 references

language of work or name

English

0 references

publication date

1 September 1991

0 references

full work available at URL

https://link.springer.com/article/10.1007/BF02574698

0 references

published in

Discrete and Computational Geometry

0 references

volume

6

0 references

issue

3

0 references

page(s)

407-422

0 references

maintained by WikiProject

WikiProject Mathematics

0 references

exact match

https://scigraph.springernature.com/pub.10.1007/bf02574698

0 references

cites work

Combinatorial Complexity Bounds for Arrangement of Curves and Spheres

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1007%2FBF02574698

retrieved

21 January 2018

Computational Geometry

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1007%2FBF02574698

retrieved

21 January 2018

Planar point location using persistent search trees

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1007%2FBF02574698

retrieved

21 January 2018

A randomized algorithm for fixed-dimensional linear programming

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1007%2FBF02574698

retrieved

21 January 2018

Optimal Point Location in a Monotone Subdivision

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1007%2FBF02574698

retrieved

21 January 2018

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1007%2FBF02574698

retrieved

21 January 2018

Closest-point problems

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1007%2FBF02574698

retrieved

21 January 2018

Identifiers

DOI

10.1007/BF02574698

0 references

DBLP publication ID

journals/dcg/AgarwalES91

1 reference

stated in

DBLP Dataset 2021-01-02

retrieved

28 January 2021

zbMATH Open document ID

0753.68089

0 references

(Q54310199)

Euclidean minimum spanning trees and bichromatic closest pairs

Statements

Identifiers

Sitelinks

Wikipedia(0 entries)

Wikibooks(0 entries)

Wikinews(0 entries)

Wikiquote(0 entries)

Wikisource(0 entries)

Wikiversity(0 entries)

Wikivoyage(0 entries)

Wiktionary(0 entries)

Multilingual sites(0 entries)