On the public citation graph

Off-Line Maintenance of Planar Configurations

https://doi.org/10.1006/jagm.1996.0054
0 signed · 57 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/bf01840386openalex-snapshot
Dynamic fractional cascading
inferredcites →https://doi.org/10.1007/bf01840440openalex-snapshot
Fractional cascading: I. A data structuring technique
inferredcites →https://doi.org/10.1007/bf01994880openalex-snapshot
Applications of a semi-dynamic convex hull algorithm
inferredcites →https://doi.org/10.1007/bf02187797openalex-snapshot
A new approach to the dynamic maintenance of maximal points in a plane
inferredcites →https://doi.org/10.1016/0022-0000(81)90012-xopenalex-snapshot
Maintenance of configurations in the plane
inferredcites →https://doi.org/10.1016/0022-0000(85)90014-5openalex-snapshot
A linear-time algorithm for a special case of disjoint set union
inferredcites →https://doi.org/10.1109/sfcs.1991.185368openalex-snapshot
Randomized multidimensional search trees: lazy balancing and dynamic shuffling
inferredcites →https://doi.org/10.1109/sfcs.1991.185369openalex-snapshot
Dynamic maintenance of geometric structures made easy
inferredcites →https://doi.org/10.1109/tit.1985.1057060openalex-snapshot
On the convex layers of a planar set
inferredcites →https://doi.org/10.1137/0213024openalex-snapshot
Fast Algorithms for Finding Nearest Common Ancestors
inferredcites →https://doi.org/10.1142/s0218195991000025openalex-snapshot
COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS
inferredcites →https://doi.org/10.1145/12130.12142openalex-snapshot
Making data structures persistent
inferredcites →https://doi.org/10.1145/160985.161172openalex-snapshot
Compliant motion in a simple polygon
inferredcites →https://doi.org/10.1145/359131.359132openalex-snapshot
An optimal real-time algorithm for planar convex hulls
inferredcites →https://doi.org/10.1145/3828.3839openalex-snapshot
Adding range restriction capability to dynamic data structures
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.4165972openalex-extracted
inferred← citeshttps://doi.org/10.1002/net.20313openalex-snapshot
Minimax flow tree problems
inferred← citeshttps://doi.org/10.1002/net.v54:3openalex-snapshot
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_7openalex-snapshot
Dynamic Planar Convex Hull with Optimal Query Time and O(log n · log log n) Update Time
inferred← citeshttps://doi.org/10.1007/3-540-54967-6_83openalex-snapshot
Usefulness of angle-sweep over line-sweep
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-031-38906-1_46openalex-snapshot
Dynamic Convex Hulls Under Window-Sliding Updates
inferred← citeshttps://doi.org/10.1007/978-3-319-30139-6_14openalex-snapshot
Covering Points with Convex Sets of Minimum Size
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_22openalex-snapshot
New Results on Minimax Regret Single Facility Ordered Median Location Problems on Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_55openalex-snapshot
Weighted Rectilinear Approximation of Points in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_47openalex-snapshot
Free-Form Surface Partition in 3-D
inferred← citeshttps://doi.org/10.1007/978-3-642-17514-5_11openalex-snapshot
Spanning Ratio and Maximum Detour of Rectilinear Paths in the L 1 Plane
inferred← citeshttps://doi.org/10.1007/bf02574030openalex-snapshot
Dynamic Euclidean minimum spanning trees and extrema of binary functions
inferred← citeshttps://doi.org/10.1007/s00454-024-00715-0openalex-snapshot
Dynamic Convex Hulls for Simple Paths
inferred← citeshttps://doi.org/10.1007/s10957-007-9232-yopenalex-snapshot
Primal-Dual Simplex Method for Multiobjective Linear Programming
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.2005.08.007openalex-snapshot
Proximity problems on line segments spanned by points
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101655openalex-snapshot
Trajectory planning for an articulated probe
inferred← citeshttps://doi.org/10.1016/j.comgeo.2021.101768openalex-snapshot
Efficient planar two-center algorithms
inferred← citeshttps://doi.org/10.1016/j.comgeo.2026.102258openalex-snapshot
Constrained two-line center problems
inferred← citeshttps://doi.org/10.1016/j.dam.2014.10.022openalex-snapshot
Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks
inferred← citeshttps://doi.org/10.1016/j.ipl.2024.106495openalex-snapshot
A linear-time algorithm for the center problem in weighted cycle graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.02.033openalex-snapshot
Efficient algorithms for center problems in cactus networks
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00177-3openalex-snapshot
2-Medians in trees with pos/neg weights
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00599-1openalex-snapshot
Improved algorithms for several network location problems with equality measures
inferred← citeshttps://doi.org/10.1109/cisp.2009.5305692openalex-snapshot
A Parallel Dynamic Convex Hull Algorithm Based on the Macro to Micro Model
inferred← citeshttps://doi.org/10.1109/iccsit.2010.5563736openalex-snapshot
Notice of Retraction: A parallel dynamic convex hull algorithm based on the M2M model originated from thinking pattern of human beings
inferred← citeshttps://doi.org/10.1109/services.2012.32openalex-snapshot
Visual Assessment of Cloud Resource Consolidation Managers Using Convex Hulls
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181985openalex-snapshot
Dynamic planar convex hull
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814581openalex-snapshot
Dynamic planar convex hull operations in near-logarithmic amortized time
inferred← citeshttps://doi.org/10.1137/s0097539797329373openalex-snapshot
Robust Plane Sweep for Intersecting Segments
inferred← citeshttps://doi.org/10.1137/s0895480198340967openalex-snapshot
The Obnoxious Center Problem on a Tree
inferred← citeshttps://doi.org/10.1142/s0218195911003834openalex-snapshot
FREE-FORM SURFACE PARTITION IN 3-D
inferred← citeshttps://doi.org/10.1142/s0218195912600035openalex-snapshot
COMPUTING THE STRETCH FACTOR AND MAXIMUM DETOUR OF PATHS, TREES, AND CYCLES IN THE NORMED SPACE
inferred← citeshttps://doi.org/10.1145/1869790.1869821openalex-snapshot
An algorithmic framework for segmenting trajectories based on spatio-temporal criteria
inferred← citeshttps://doi.org/10.1145/234535.234536openalex-snapshot
Computing the discrepancy with applications to supersampling patterns
inferred← citeshttps://doi.org/10.1145/363647.363652openalex-snapshot
Dynamic planar convex hull operations in near-logarithmic amortized time
inferred← citeshttps://doi.org/10.1287/ijoc.1080.0280openalex-snapshot
Minimax Regret Single-Facility Ordered Median Location Problems on Networks
inferred← citeshttps://doi.org/10.2139/ssrn.5399790openalex-snapshot
Constrained Two-Line Center Problems
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0209007openalex-snapshot
A Survey and a New Competitive Method for the Planar min-# Problem
inferred← citeshttps://doi.org/10.5311/josis.2011.3.66openalex-snapshot
Segmenting trajectories: A framework and algorithms using spatiotemporal criteria
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.