On the public citation graph

Planar geometric location problems

0 signed · 82 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01187037openalex-snapshot

Selecting distances in the plane

inferredcites →https://doi.org/10.1007/bf01840442openalex-snapshot

Geometric complexity of some location problems

inferredcites →https://doi.org/10.1016/0196-6774(91)90013-oopenalex-snapshot

Finding tailored partitions

inferredcites →https://doi.org/10.1016/0925-7721(91)90001-uopenalex-snapshot

Off-line dynamic maintenance of the width of a planar point set

inferredcites →https://doi.org/10.1016/0925-7721(93)90001-mopenalex-snapshot

A convex polygon among polygonal obstacles: placement and high-clearance motion

inferredcites →https://doi.org/10.1016/s0925-7721(00)00026-2openalex-snapshot

Hamilton cycles in the path graph of a set of points in convex position

inferredcites →https://doi.org/10.1137/0212052openalex-snapshot

Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems

inferredcites →https://doi.org/10.1137/0213014openalex-snapshot

On the Complexity of Some Common Geometric Location Problems

inferredcites →https://doi.org/10.1145/2157.322410openalex-snapshot

Applying Parallel Computation Algorithms in the Design of Serial Algorithms

inferredcites →https://doi.org/10.1145/62212.62255openalex-snapshot

Optimal algorithms for approximate clustering

inferredcites →https://doi.org/10.1145/73833.73853openalex-snapshot

Placing the largest similar copy of a convex polygon among polygonal obstacles

inferredcites →https://doi.org/10.1145/7531.7537openalex-snapshot

Slowing down sorting networks to obtain faster sorting algorithms

inferredcites →https://doi.org/10.1287/trsc.18.4.351openalex-snapshot

The Planar Two-Center and Two-Median Problems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jagm.1997.0922openalex-snapshot

Data Collection for the Sloan Digital Sky Survey—A Network-Flow Heuristic

inferred← citeshttps://doi.org/10.1007/3-540-60220-8_48openalex-snapshot

On some geometric selection and optimization problems via sorted matrices

inferred← citeshttps://doi.org/10.1007/978-0-387-35608-2_5openalex-snapshot

Lower and Upper Bounds for Tracking Mobile Users

inferred← citeshttps://doi.org/10.1007/978-3-030-24766-9_3openalex-snapshot

Efficient Nearest-Neighbor Query and Clustering of Planar Curves

inferred← citeshttps://doi.org/10.1007/978-3-030-24766-9_42openalex-snapshot

Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points

inferred← citeshttps://doi.org/10.1007/978-3-030-79987-8_12openalex-snapshot

Covering Convex Polygons by Two Congruent Disks

inferred← citeshttps://doi.org/10.1007/978-3-030-79987-8_28openalex-snapshot

Intersecting Disks Using Two Congruent Disks

inferred← citeshttps://doi.org/10.1007/978-3-031-06678-8_15openalex-snapshot

An Efficient Algorithm for the Proximity Connected Two Center Problem

inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_18openalex-snapshot

Efficient k-Center Algorithms for Planar Points in Convex Position

inferred← citeshttps://doi.org/10.1007/978-3-319-12691-3_4openalex-snapshot

Optimizing Squares Covering a Set of Points

inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_6openalex-snapshot

An Efficient Algorithm for 2D Euclidean 2-Center with Outliers

inferred← citeshttps://doi.org/10.1007/bf01187037openalex-snapshot

Selecting distances in the plane

inferred← citeshttps://doi.org/10.1007/bf02564785openalex-snapshot

Location of rectilinear center trajectories

inferred← citeshttps://doi.org/10.1007/bf02573973openalex-snapshot

Diameter, width, closest line pair, and parametric searching

inferred← citeshttps://doi.org/10.1007/bfb0009480openalex-snapshot

Optimal line bipartitions of point sets

inferred← citeshttps://doi.org/10.1007/bfb0015247openalex-snapshot

Algorithmic techniques for geometric optimization

inferred← citeshttps://doi.org/10.1007/bfb0054358openalex-snapshot

Constrained square-center problems

inferred← citeshttps://doi.org/10.1007/pl00009311openalex-snapshot

A Near-Linear Algorithm for the Planar 2-Center Problem

inferred← citeshttps://doi.org/10.1007/pl00009387openalex-snapshot

The Discrete 2-Center Problem

inferred← citeshttps://doi.org/10.1007/s00224-025-10228-9openalex-snapshot

An Optimal and Practical Algorithm for the Planar 2-center Problem

inferred← citeshttps://doi.org/10.1007/s00454-021-00358-5openalex-snapshot

On the Planar Two-Center Problem and Circular Hulls

inferred← citeshttps://doi.org/10.1007/s10878-023-00996-wopenalex-snapshot

The two-center problem of uncertain points on a real line

inferred← citeshttps://doi.org/10.1007/s11036-006-4470-zopenalex-snapshot

Competitive Algorithms for Maintaining a Mobile Center

inferred← citeshttps://doi.org/10.1016/0020-0190(91)90177-jopenalex-snapshot

Randomized optimal algorithm for slope selection

inferred← citeshttps://doi.org/10.1016/0166-218x(93)e0173-vopenalex-snapshot

Optimal separable partitioning in the plane

inferred← citeshttps://doi.org/10.1016/0925-7721(91)90001-uopenalex-snapshot

Off-line dynamic maintenance of the width of a planar point set

inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.11.005openalex-snapshot

The 2-center problem in three dimensions

inferred← citeshttps://doi.org/10.1016/j.comgeo.2021.101768openalex-snapshot

Efficient planar two-center algorithms

inferred← citeshttps://doi.org/10.1016/j.comgeo.2021.101806openalex-snapshot

Improved algorithms for the bichromatic two-center problem for pairs of points

inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101936openalex-snapshot

Covering convex polygons by two congruent disks

inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101966openalex-snapshot

Intersecting disks using two congruent disks

inferred← citeshttps://doi.org/10.1016/j.comgeo.2025.102185openalex-snapshot

Parallel line centers with guaranteed separation

inferred← citeshttps://doi.org/10.1016/j.comgeo.2026.102258openalex-snapshot

Constrained two-line center problems

inferred← citeshttps://doi.org/10.1016/j.ipl.2008.07.010openalex-snapshot

Approximating nearest neighbor among triangles in convex position

inferred← citeshttps://doi.org/10.1016/j.jda.2003.12.001openalex-snapshot

Selecting distances in arrangements of hyperplanes spanned by points

inferred← citeshttps://doi.org/10.1016/j.tcs.2015.11.029openalex-snapshot

Optimizing squares covering a set of points

inferred← citeshttps://doi.org/10.1016/j.tcs.2020.05.045openalex-snapshot

Minimum-width double-strip and parallelogram annulus

inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115583openalex-snapshot

On k -enclosing slab problems

inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00402-7openalex-snapshot

A fast algorithm for the alpha-connected two-center decision problem

inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00049-5openalex-snapshot

Linear approximation of simple objects

inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00647-1openalex-snapshot

Continuous location of dimensional structures

inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00017-0openalex-snapshot

On some geometric selection and optimization problems via sorted matrices

inferred← citeshttps://doi.org/10.1016/s0925-7721(99)00019-xopenalex-snapshot

More planar two-center algorithms

inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80124-0openalex-snapshot

Chapter 7 A survey of computational geometry

inferred← citeshttps://doi.org/10.1109/istcs.1995.377043openalex-snapshot

Improved algorithms in geometric optimization via expanders

inferred← citeshttps://doi.org/10.1137/0222051openalex-snapshot

Ray Shooting and Parametric Search

inferred← citeshttps://doi.org/10.1137/s0097539794268649openalex-snapshot

An Expander-Based Approach to Geometric Optimization

inferred← citeshttps://doi.org/10.1142/s021819590800257xopenalex-snapshot

BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES

inferred← citeshttps://doi.org/10.1142/s0218195999000042openalex-snapshot

OPTIMAL LINE BIPARTITIONS OF POINT SETS

inferred← citeshttps://doi.org/10.1142/s0218195999000091openalex-snapshot

COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET

inferred← citeshttps://doi.org/10.1145/160985.161137openalex-snapshot

An expander-based approach to geometric optimization

inferred← citeshttps://doi.org/10.1145/177424.178038openalex-snapshot

An efficient algorithm for the Euclidean two-center problem

inferred← citeshttps://doi.org/10.1145/1810959.1810974openalex-snapshot

The 2-center problem in three dimensions

inferred← citeshttps://doi.org/10.1145/237218.237251openalex-snapshot

A near-linear algorithm for the planar 2-center problem

inferred← citeshttps://doi.org/10.1145/262839.262921openalex-snapshot

The discrete 2-center problem

inferred← citeshttps://doi.org/10.1145/299917.299918openalex-snapshot

Efficient algorithms for geometric optimization

inferred← citeshttps://doi.org/10.1145/345848.345858openalex-snapshot

Mobile facility location (extended abstract)

inferred← citeshttps://doi.org/10.1145/3798129.3800753openalex-snapshot

Fine-Grained Complexity of Continuous Euclidean k-Center

inferred← citeshttps://doi.org/10.1287/moor.1090.0406openalex-snapshot

Locating Objects in the Plane Using Global Optimization Techniques

inferred← citeshttps://doi.org/10.14288/1.0051487openalex-snapshot

Geometric facility location under continuous motion: bounded-velocity approximations to the mobile Euclidean k-centre and k-median problems

inferred← citeshttps://doi.org/10.20382/jocg.v6i1a4openalex-snapshot

Algorithms for ball hulls and ball intersections in normed planes

inferred← citeshttps://doi.org/10.2139/ssrn.5399790openalex-snapshot

Constrained Two-Line Center Problems

inferred← citeshttps://doi.org/10.3390/s041100181openalex-snapshot

2-Sensor Problem

inferred← citeshttps://doi.org/10.3390/s41100181openalex-snapshot

2-Sensor Problem

inferred← citeshttps://doi.org/10.4230/lipics.socg.2020.68openalex-snapshot

On the Planar Two-Center Problem and Circular Hulls

inferred← citeshttps://doi.org/10.48550/arxiv.1012.2694openalex-snapshot

The 2-Center Problem in Three Dimensions

inferred← citeshttps://doi.org/10.48550/arxiv.1905.00157openalex-snapshot

Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points

inferred← citeshttps://doi.org/10.5555/338219.338603openalex-snapshot

Approximation algorithms for projective clustering

inferred← citeshttps://doi.org/10.6109/jicce.2012.10.1.001openalex-snapshot

Minimizing the Average Distance of Separated Points on the Plane in the L1-Distance

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.