On the public citation graph
Computing the constrained Euclidean, geodesic and link centre of a simple polygon with applications
0 signed · 50 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4684-6578-5openalex-snapshot
Plastics Mold Engineering Handbook
inferredcites →https://doi.org/10.1007/bf01840360openalex-snapshot
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
inferredcites →https://doi.org/10.1007/bf02187751openalex-snapshot
Computing the geodesic center of a simple polygon
inferredcites →https://doi.org/10.1007/bf02187913openalex-snapshot
Computing the link center of a simple polygon
inferredcites →https://doi.org/10.1007/bf02189321openalex-snapshot
The furthest-site geodesic voronoi diagram
inferredcites →https://doi.org/10.1007/bf02293040openalex-snapshot
AnO(n logn) algorithm for computing the link center of a simple polygon
inferredcites →https://doi.org/10.1007/bf02574703openalex-snapshot
Triangulating a simple polygon in linear time
inferredcites →https://doi.org/10.1007/bfb0028976openalex-snapshot
An O(n log n) algorithm for computing a link center in a simple polygon
inferredcites →https://doi.org/10.1016/0022-0000(89)90041-xopenalex-snapshot
Optimal shortest path queries in a simple polygon
inferredcites →https://doi.org/10.1016/0022-0000(89)90045-7openalex-snapshot
Computing geodesic furthest neighbors in simple polygons
inferredcites →https://doi.org/10.1016/0097-8493(94)90061-2openalex-snapshot
Geometric and computational aspects of manufacturing processes
inferredcites →https://doi.org/10.1016/0196-6774(91)90024-sopenalex-snapshot
Computing the visibility polygon from a convex set and related problems
inferredcites →https://doi.org/10.1016/b978-0-444-87806-9.50008-6openalex-snapshot
On Geometric Algorithms that use the Furthest-Point Voronoi Diagram
inferredcites →https://doi.org/10.1109/70.88124openalex-snapshot
On some link distance problems in a simple polygon
inferredcites →https://doi.org/10.1109/tc.1981.1675729openalex-snapshot
An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferredcites →https://doi.org/10.1145/41958.41959openalex-snapshot
Computing the link center of a simple polygon
inferredcites →https://doi.org/10.1145/6138.6151openalex-snapshot
Planar point location using persistent search trees
inferredcites →https://doi.org/10.1201/9780429506635openalex-snapshot
Processes and Design for Manufacturing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11604655_14openalex-snapshot
Efficient Algorithm for Placing Base Stations by Avoiding Forbidden Zone
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_18openalex-snapshot
Facility Location Constrained to a Polygonal Domain
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_13openalex-snapshot
Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon
inferred← citeshttps://doi.org/10.1007/978-3-319-21407-8_16openalex-snapshot
Constrained k-Center Problem on a Convex Polygon
inferred← citeshttps://doi.org/10.1007/978-3-319-29221-2_11openalex-snapshot
Linear Time Algorithms for Euclidean 1-Center in $$\mathfrak {R}^d$$ with Non-linear Convex Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-53058-1_9openalex-snapshot
The Euclidean k-Supplier Problem in "Equation missing"
inferred← citeshttps://doi.org/10.1007/978-3-642-03367-4_20openalex-snapshot
Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_8openalex-snapshot
Optimal Algorithms for Constrained 1-Center Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-56082-8_2openalex-snapshot
Continuous Covering Location Problems
inferred← citeshttps://doi.org/10.1007/s00170-004-1633-6openalex-snapshot
Optimisation of gate location with design constraints
inferred← citeshttps://doi.org/10.1007/s10878-012-9532-5openalex-snapshot
An approximation algorithm for k-center problem on a convex polygon
inferred← citeshttps://doi.org/10.1007/s10878-015-9933-3openalex-snapshot
An incremental version of the k-center problem on boundary of a convex polygon
inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.01.002openalex-snapshot
Constrained minimum enclosing circle with center on a query line segment
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.07.002openalex-snapshot
Fast computation of smallest enclosing circle with center on a query line segment
inferred← citeshttps://doi.org/10.1016/j.jpdc.2007.08.005openalex-snapshot
Base station placement on boundary of a convex polygon
inferred← citeshttps://doi.org/10.1039/c9nr03696bopenalex-snapshot
Quantification of DNA damage induced repair focus formation via super-resolution dSTORM localization microscopy
inferred← citeshttps://doi.org/10.1109/ciss.2008.4558649openalex-snapshot
Optimal path planning for mobile backbone networks
inferred← citeshttps://doi.org/10.1109/icectech.2011.5941660openalex-snapshot
Classical knapsack to geometric knapsack: A journey
inferred← citeshttps://doi.org/10.1109/rteict46194.2019.9016979openalex-snapshot
An Iterative Approach for Optimal Number of Balanced Clusters and Placement of Cluster Heads in WSN with Spatial Constraints
inferred← citeshttps://doi.org/10.1117/12.2545099openalex-snapshot
Quantification of labelled target molecules via super-resolution dSTORM localization microscopy
inferred← citeshttps://doi.org/10.1142/9789812836243_0010openalex-snapshot
Range Assignment Problem in Wireless Network
inferred← citeshttps://doi.org/10.1142/s0218195911003597openalex-snapshot
THE ALIGNED K-CENTER PROBLEM
inferred← citeshttps://doi.org/10.20382/jocg.v5i1a2openalex-snapshot
The Hausdorff core problem on simple polygons
inferred← citeshttps://doi.org/10.22214/ijraset.2022.42027openalex-snapshot
Optimization of Gating System for Sand Casting Using Sequential Quadratic Programming
inferred← citeshttps://doi.org/10.22215/etd/2016-11514openalex-snapshot
On Proximity Problems In Euclidean Spaces
inferred← citeshttps://doi.org/10.22215/etd/2024-16080openalex-snapshot
Shortest Path Problems in Weighted Regions
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2021.41openalex-snapshot
Separated Red Blue Center Clustering
inferred← citeshttps://doi.org/10.48550/arxiv.0902.3282openalex-snapshot
Computing k-Centers On a Line
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.