On the public citation graph

Applications of a semi-dynamic convex hull algorithm

https://doi.org/10.1007/bf01994880

0 signed · 106 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/978-1-4612-1098-6openalex-snapshot

Computational Geometry

inferredcites →https://doi.org/10.1007/978-1-4612-5498-0openalex-snapshot

Problem-Solving Through Problems

inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot

Algorithms in Combinatorial Geometry

inferredcites →https://doi.org/10.1016/0020-0190(72)90045-2openalex-snapshot

An efficient algorith for determining the convex hull of a finite planar set

inferredcites →https://doi.org/10.1016/0020-0190(89)90126-9openalex-snapshot

An O(nlog2n) algorithm for the maximum weigthed tardiness problem

inferredcites →https://doi.org/10.1016/0020-0190(90)90184-yopenalex-snapshot

A faster algorithm for the maximum weighted tardiness problem

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)90065-0openalex-snapshot

A matching problem in the plane

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

Finding tailored partitions

inferredcites →https://doi.org/10.1109/tit.1985.1057060openalex-snapshot

On the convex layers of a planar set

inferredcites →https://doi.org/10.1111/j.1749-6632.1989.tb22429.xopenalex-snapshot

Disjoint Simplices and Geometric Hypergraphs

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

The Ultimate Planar Convex Hull Algorithm?

inferredcites →https://doi.org/10.1142/s0218195991000025openalex-snapshot

COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS

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

An optimal real-time algorithm for planar convex hulls

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

Compliant motion in a simple polygon

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

Lower bounds for algebraic computation trees

inferredcites →https://doi.org/10.1287/mnsc.19.5.544openalex-snapshot

Optimal Sequencing of a Single Machine Subject to Precedence Constraints

inferredcites →https://doi.org/10.2307/2323729openalex-snapshot

Problem-Solving through 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.1996.0054openalex-snapshot

Off-Line Maintenance of Planar Configurations

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

Data Structures for Mobile Data

inferred← citeshttps://doi.org/10.1007/3-540-26772-7_18openalex-snapshot

Distributed Ranking Methods for Geographic Information Retrieval

inferred← citeshttps://doi.org/10.1007/3-540-44634-6_18openalex-snapshot

On the Reflexivity of Point Sets

inferred← citeshttps://doi.org/10.1007/3-540-44634-6_25openalex-snapshot

Partitioning Colored Point Sets into Monochromatic Parts

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-60313-1_163openalex-snapshot

The centroid of points with approximate weights

inferred← citeshttps://doi.org/10.1007/3-540-63938-1_47openalex-snapshot

On embedding an outer-planar graph in a point set

inferred← citeshttps://doi.org/10.1007/978-3-030-67899-9_12openalex-snapshot

New Variants of Perfect Non-crossing Matchings

inferred← citeshttps://doi.org/10.1007/978-3-031-20624-5_44openalex-snapshot

Complexity Results on Untangling Red-Blue Matchings

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-031-49272-3_22openalex-snapshot

Three Edge-Disjoint Plane Spanning Paths in a Point Set

inferred← citeshttps://doi.org/10.1007/978-3-032-17801-5_39openalex-snapshot

Edge-Constrained Hamiltonian Paths on a Point Set

inferred← citeshttps://doi.org/10.1007/978-3-319-21840-3_6openalex-snapshot

An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs

inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_7openalex-snapshot

Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps

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

Relative Convex Hulls in Semi-dynamic Subdivisions

inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_46openalex-snapshot

Inducing Polygons of Line Arrangements

inferred← citeshttps://doi.org/10.1007/978-3-642-03456-5_20openalex-snapshot

On Map Labeling with Leaders

inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_5openalex-snapshot

On Inducing Polygons and Related Problems

inferred← citeshttps://doi.org/10.1007/978-3-642-04652-0_1openalex-snapshot

Self-adjusting Computation with Delta ML

inferred← citeshttps://doi.org/10.1007/978-3-642-31155-0_19openalex-snapshot

Minimum Convex Partitions and Maximum Empty Polytopes

inferred← citeshttps://doi.org/10.1007/978-3-642-34191-5_14openalex-snapshot

Spiral Serpentine Polygonization of a Planar Point Set

inferred← citeshttps://doi.org/10.1007/978-3-642-55566-4_6openalex-snapshot

On the Reflexivity of Point Sets

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

Dynamic half-space range reporting and its applications

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

Optimal algorithms to embed trees in a point set

inferred← citeshttps://doi.org/10.1007/s00373-015-1547-0openalex-snapshot

Geometric Biplane Graphs II: Graph Augmentation

inferred← citeshttps://doi.org/10.1007/s00453-009-9322-3openalex-snapshot

On Bounded Leg Shortest Paths Problems

inferred← citeshttps://doi.org/10.1007/s00453-011-9551-0openalex-snapshot

Augmenting the Edge Connectivity of Planar Straight Line Graphs to Three

inferred← citeshttps://doi.org/10.1007/s00453-012-9679-6openalex-snapshot

Relative Convex Hulls in Semi-Dynamic Arrangements

inferred← citeshttps://doi.org/10.1007/s00453-013-9814-zopenalex-snapshot

Isotonic Regression for Multiple Independent Variables

inferred← citeshttps://doi.org/10.1007/s00453-019-00588-3openalex-snapshot

Two Approaches to Building Time-Windowed Geometric Data Structures

inferred← citeshttps://doi.org/10.1007/s00453-025-01358-0openalex-snapshot

Computing the Minimum Bottleneck Moving Spanning Tree

inferred← citeshttps://doi.org/10.1007/s00454-003-2923-8openalex-snapshot

A Fully Dynamic Algorithm for Planar Width

inferred← citeshttps://doi.org/10.1007/s00454-024-00715-0openalex-snapshot

Dynamic Convex Hulls for Simple Paths

inferred← citeshttps://doi.org/10.1007/s10707-004-5622-6openalex-snapshot

Multi-Dimensional Scattered Ranking Methods for Geographic Information Retrieval*

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

Boundary labeling: Models and efficient algorithms for rectangular maps

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

Covering point sets with two disjoint disks or squares

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

Fitting a two-joint orthogonal chain to a point set

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

Connectivity guarantees for wireless networks with directional antennas

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

On inducing polygons and related problems

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

An optimal algorithm for plane matchings in multipartite geometric graphs

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

On Hamiltonian alternating cycles and paths

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

Complexity results on untangling red-blue matchings

inferred← citeshttps://doi.org/10.1016/j.dam.2023.09.016openalex-snapshot

New variants of perfect non-crossing matchings

inferred← citeshttps://doi.org/10.1016/j.disc.2025.114780openalex-snapshot

Three edge-disjoint plane spanning paths in a point set

inferred← citeshttps://doi.org/10.1016/j.ic.2026.105440openalex-snapshot

On the online weighted non-crossing matching problem

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

Packing plane spanning trees and paths in complete geometric graphs

inferred← citeshttps://doi.org/10.1016/j.jcss.2017.09.001openalex-snapshot

Weighted L∞ isotonic regression

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

Algorithms for optimal outlier removal

inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00042-6openalex-snapshot

Bipartite embeddings of trees in the plane

inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00069-4openalex-snapshot

On embedding an outer-planar graph in a point set

inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00126-8openalex-snapshot

Tight degree bounds for pseudo-triangulations of points

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

Chapter 7 A survey of computational geometry

inferred← citeshttps://doi.org/10.1080/02331934.2016.1276905openalex-snapshot

Minimization and maximization versions of the quadratic travelling salesman problem

inferred← citeshttps://doi.org/10.1108/02644409910304086openalex-snapshot

Convex hull of a planar set of straight and circular line segments

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/iccsa.2007.50openalex-snapshot

Dynamic Software Adaptation with Dependence Analysis for Multi-Agent Platform

inferred← citeshttps://doi.org/10.1109/iccsa.2007.72openalex-snapshot

Kinetic Convex Hull Algorithm Using Spiral Kinetic Data Structure

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/icmcm.1998.670757openalex-snapshot

Membrane design for MCM and BGA substrate test

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/100804310openalex-snapshot

Shooting Permanent Rays among Disjoint Polygons in the Plane

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

PARTITIONING COLORED POINT SETS INTO MONOCHROMATIC PARTS

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

INDUCING POLYGONS OF LINE ARRANGEMENTS

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

THREE PROBLEMS ABOUT DYNAMIC CONVEX HULLS

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

Addendum to Etude on theme of Dijkstra

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

Shooting permanent rays among disjoint polygons in the plane

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

Long non-crossing configurations in the plane

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

Three problems about dynamic convex hulls

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

Ramsey-type results for geometric graphs

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

Ramsey-type results for geometric graphs. II

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

Efficient algorithms for line and curve segment intersection using restricted predicates

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

Common Tangents of Two Disjoint Polygons in Linear Time and Constant Workspace

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

Dynamic planar convex hull operations in near-logarithmic amortized time

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

Minimum Plane Bichromatic Spanning Trees

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

A fully dynamic algorithm for planar

inferred← citeshttps://doi.org/10.22215/etd/2017-11741openalex-snapshot

Matchings in Geometric Graphs

inferred← citeshttps://doi.org/10.23638/dmtcs-21-3-6openalex-snapshot

$K_{1,3}$-covering red and blue points in the plane

inferred← citeshttps://doi.org/10.3233/fi-1995-2245openalex-snapshot

LONG NON-CROSSING CONFIGURATIONS IN THE PLANE

inferred← citeshttps://doi.org/10.4230/lipics.esa.2016.4openalex-snapshot

An Optimal Algorithm for the Separating Common Tangents of two Polygons

inferred← citeshttps://doi.org/10.4230/lipics.isaac.2019.51openalex-snapshot

Euclidean TSP, Motorcycle Graphs, and Other New Applications of Nearest-Neighbor Chains

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

An Optimal Algorithm for the Separating Common Tangents of Two Polygons

inferred← citeshttps://doi.org/10.46298/dmtcs.2132openalex-snapshot

Packing Plane Perfect Matchings into a Point Set

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

Minimum Convex Partitions and Maximum Empty Polytopes

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.5555/1283383.1283466openalex-snapshot

On bounded leg shortest paths problems

inferred← citeshttps://doi.org/10.7155/jgaa.00002openalex-snapshot

Optimal Algorithms to Embed Trees in a Point Set

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.