scientific article
From MaRDI portal
Publication:3044324
zbMath1059.90516MaRDI QIDQ3044324
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2286/22860153.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete location and assignment (90B80)
Related Items (7)
Linear time algorithms for Euclidean 1-center in \(\mathfrak {R}^d\) with non-linear convex constraints ⋮ Some variations on constrained minimum enclosing circle problem ⋮ Approximating generalized distance functions on weighted triangulated surfaces with applications ⋮ Constrained minimum enclosing circle with center on a query line segment ⋮ Largest empty circle centered on a query line ⋮ Fast computation of smallest enclosing circle with center on a query line segment ⋮ Linear Time Algorithms for Euclidean 1-Center in $$\mathfrak {R}^d$$ with Non-linear Convex Constraints
This page was built for publication: