Fast computation of smallest enclosing circle with center on a query line segment
type: Item
instance of: scholarly article
title: Fast computation of smallest enclosing circle with center on a query line segment
zbMATH Open document ID: 1191.68765
author: Arindam Karmakar
author: Sasanka Roy
author: Sandip Das
published in: Information Processing Letters
publication date: 2010-06-09T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5719210
zbMATH Keywords: 1-center problem
zbMATH Keywords: furthest point Voronoi diagram
zbMATH Keywords: geometric duality
zbMATH Keywords: computational geometry
zbMATH Keywords: algorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2008.07.002
OpenAlex ID: W2145360688
cites work: Q4344150
cites work: Q3044324
cites work: Optimal Point Location in a Monotone Subdivision
cites work: Some constrained minimax and maximin location problems
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: Constrained Minimum Enclosing Circle with Center on a Query Line Segment
DOI: 10.1016/J.IPL.2008.07.002
description: scientific article; zbMATH DE number 5719210