In computational geometry, the largest empty sphere problem is the problem of finding a hypersphere of largest radius in d-dimensional space whoseâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2011

2011

- Tetsuo Asano, â€ Wolfgang, Yajun Wang
- 2011

Constant-work-space algorithms may use only constantly many cells of storage in addition to their input, which is provided as aâ€¦Â (More)

Is this relevant?

2010

2009

2009

- Tetsuo Asano, GÃ¼nter Rote
- CCCG
- 2009

Constant-work-space algorithms may use only constantly many cells of storage in addition to their input, which is provided as aâ€¦Â (More)

Is this relevant?

2004

2004

- Jong-Seok Lee, Taeg-Sang Cho, +4 authors Cheol Hoon Park
- 2004

This paper presents a novel approach to solve the largest empty sphere (LES) problem in the multidimensional space by using aâ€¦Â (More)

Is this relevant?

2002

2002

- Timothy M. Chan
- SODA
- 2002

We give the first nontrivial worst-case results for dynamic versions of various basic geometric optimization and measure problemsâ€¦Â (More)

Is this relevant?

1994

1994

- Frank Dehne, Claire Mathieu, Andreas Fabri
- SPDP
- 1994

1 Abstract We present parallel computational geometry algorithms that are scalable, architecture independent, easy to implementâ€¦Â (More)

Is this relevant?

1991

1991

- Philip D. MacKenzie, Quentin F. Stout
- SODA
- 1991

It has been shown previously that given n items and a polynomial number of processors, sorting these items into n locationsâ€¦Â (More)

Is this relevant?

1990

1990

- C. S. Jeong, D. T. Lee
- Algorithmica
- 1990

We show that a number of geometric problems can be solved on a âˆšn Ã— âˆšn mesh-connected computer (MCC) inO(âˆšn) time, which isâ€¦Â (More)

Is this relevant?

1985

1985

- Russ Miller, Quentin F. Stout
- IEEE Transactions on Pattern Analysis and Machineâ€¦
- 1985

Although mesh-connected computers are used almost exclusively for low-level local image processing, they are also suitable forâ€¦Â (More)

Is this relevant?

1983

1983

- Godfried T. Toussaint
- International Journal of Computer & Informationâ€¦
- 1983

LetQ = {q1, q2,..., qn} be a set ofn points on the plane. The largest empty circle (LEG) problem consists in finding the largestâ€¦Â (More)

Is this relevant?