The following pages link to (Q3044324):
Displaying 14 items.
- Approximating generalized distance functions on weighted triangulated surfaces with applications (Q425342) (← links)
- Constrained minimum enclosing circle with center on a query line segment (Q924081) (← links)
- Largest empty circle centered on a query line (Q972354) (← links)
- Fast computation of smallest enclosing circle with center on a query line segment (Q975487) (← links)
- Location of an undesirable facility in a polygonal region with forbidden zones (Q1296367) (← links)
- Improved algorithms for placing undesirable facilities (Q1941958) (← links)
- Some variations on constrained minimum enclosing circle problem (Q1944391) (← links)
- Linear time algorithms for Euclidean 1-center in \(\mathfrak {R}^d\) with non-linear convex constraints (Q2181246) (← links)
- Conditional facility location problems with continuous demand and a polygonal barrier (Q2239930) (← links)
- Computing obnoxious 1-corner polygonal chains (Q2571197) (← links)
- Some constrained minimax and maximin location problems (Q2704991) (← links)
- Linear Time Algorithms for Euclidean 1-Center in $$\mathfrak {R}^d$$ with Non-linear Convex Constraints (Q2795940) (← links)
- Line Segment Facility Location in Weighted Subdivisions (Q3638446) (← links)
- (Q4459964) (← links)
