Algorithms for ball hulls and ball intersections in normed planes

Algorithms for ball hulls and ball intersections in normed planes

<p>Extending results of Hershberger and Suri for the Euclidean plane, we show that ball hulls and ball intersections of sets of $n$ points in normed planes can be constructed in $O(n \log n)$ time. In addition, we confirm that the 2-center problem with constrained circles for arbitrary normed...

Full description

Bibliographic Details
Main Authors: Pedro Martín, Horst Martini
Format: Article
Language:English
Published: Carleton University 2015-05-01
Series:Journal of Computational Geometry
Online Access:http://jocg.org/index.php/jocg/article/view/187
id doaj-8c6505c0f155407eb845a326e47bc4d5
record_format Article
spelling doaj-8c6505c0f155407eb845a326e47bc4d52020-11-24T20:45:49ZengCarleton UniversityJournal of Computational Geometry1920-180X2015-05-016110.20382/jocg.v6i1a470Algorithms for ball hulls and ball intersections in normed planesPedro Martín0Horst Martini1Departamento de Matemáticas, Universidad de Extremadura, Badajoz, SpainFakultät für Mathematik, TU Chemnitz, Chemnitz, Germany<p>Extending results of Hershberger and Suri for the Euclidean plane, we show that ball hulls and ball intersections of sets of $n$ points in normed planes can be constructed in $O(n \log n)$ time. In addition, we confirm that the 2-center problem with constrained circles for arbitrary normed planes can be solved in $O(n^2)$ time. Some ideas about the geometric structure of the ball hull in a normed plane are also presented.</p>http://jocg.org/index.php/jocg/article/view/187
collection DOAJ
language English
format Article
sources DOAJ
author Pedro Martín
Horst Martini
spellingShingle Pedro Martín
Horst Martini
Algorithms for ball hulls and ball intersections in normed planes
Journal of Computational Geometry
author_facet Pedro Martín
Horst Martini
author_sort Pedro Martín
title Algorithms for ball hulls and ball intersections in normed planes
title_short Algorithms for ball hulls and ball intersections in normed planes
title_full Algorithms for ball hulls and ball intersections in normed planes
title_fullStr Algorithms for ball hulls and ball intersections in normed planes
title_full_unstemmed Algorithms for ball hulls and ball intersections in normed planes
title_sort algorithms for ball hulls and ball intersections in normed planes
publisher Carleton University
series Journal of Computational Geometry
issn 1920-180X
publishDate 2015-05-01
description <p>Extending results of Hershberger and Suri for the Euclidean plane, we show that ball hulls and ball intersections of sets of $n$ points in normed planes can be constructed in $O(n \log n)$ time. In addition, we confirm that the 2-center problem with constrained circles for arbitrary normed planes can be solved in $O(n^2)$ time. Some ideas about the geometric structure of the ball hull in a normed plane are also presented.</p>
url http://jocg.org/index.php/jocg/article/view/187
work_keys_str_mv AT pedromartin algorithmsforballhullsandballintersectionsinnormedplanes
AT horstmartini algorithmsforballhullsandballintersectionsinnormedplanes
_version_ 1716813904721477632

Similar Items