On the public citation graph
Parallel algorithms for some functions of two convex polygons
0 signed · 72 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.1016/0022-0000(81)90012-xopenalex-snapshot
Maintenance of configurations in the plane
inferredcites →https://doi.org/10.1016/0196-6774(85)90039-2openalex-snapshot
Computing the extreme distances between two convex polygons
inferredcites →https://doi.org/10.1016/0743-7315(86)90011-0openalex-snapshot
Efficient parallel solutions to some geometric problems
inferredcites →https://doi.org/10.1145/359423.359430openalex-snapshot
Convex hulls of finite sets of points in two and three dimensions
inferredcites →https://doi.org/10.1145/800070.802196openalex-snapshot
Bounds on the time for parallel RAM's to compute simple functions
inferredcites →https://doi.org/10.1145/800141.804662openalex-snapshot
Detection is easier than computation (Extended Abstract)
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/scj.4690240101openalex-snapshot
An optimal parallel algorithm for finding shortest paths inside simple polygons
inferred← citeshttps://doi.org/10.1007/3-540-50647-0_104openalex-snapshot
A survey of parallel computational geometry algorithms
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_3openalex-snapshot
Constructing the Voronoi diagram of a set of line segments in parallel
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_235openalex-snapshot
An optimal algorithm for finding the separation of simple polygons
inferred← citeshttps://doi.org/10.1007/3-540-58078-6_15openalex-snapshot
Constant-time convexity problems on reconfigurable meshes
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_103openalex-snapshot
Line segmentation of digital curves in parallel
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_171openalex-snapshot
An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_17openalex-snapshot
Two-Center Problems for a Convex Polygon (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_56openalex-snapshot
Steiner Minimal Trees: An Introduction, Parallel Computation, and Future Work
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_13openalex-snapshot
Steiner Minimal Trees: An Introduction, Parallel Computation, and Future Work
inferred← citeshttps://doi.org/10.1007/978-3-642-15781-3_7openalex-snapshot
Geometric Algorithms for Private-Cache Chip Multiprocessors
inferred← citeshttps://doi.org/10.1007/bf01188708openalex-snapshot
Constructing the Voronoi diagram of a set of line segments in parallel
inferred← citeshttps://doi.org/10.1007/bf01293667openalex-snapshot
A time-optimal parallel algorithm for three-dimensional convex hulls
inferred← citeshttps://doi.org/10.1007/bf01293668openalex-snapshot
Finding a closest visible vertex pair between two polygons
inferred← citeshttps://doi.org/10.1007/bf01758749openalex-snapshot
Optimal parallel algorithms for point-set and polygon problems
inferred← citeshttps://doi.org/10.1007/bf01758753openalex-snapshot
Optimal randomized parallel algorithms for computational geometry
inferred← citeshttps://doi.org/10.1007/bf01901194openalex-snapshot
Parallel algorithms for shortest path problems in polygons
inferred← citeshttps://doi.org/10.1007/bf01931655openalex-snapshot
A sublogarithmic convex hull algorithm
inferred← citeshttps://doi.org/10.1007/bf01944352openalex-snapshot
A nearly optimal deterministic parallel Voronoi diagram algorithm
inferred← citeshttps://doi.org/10.1007/bfb0032049openalex-snapshot
Merging free trees in parallel for efficient voronoi diagram construction
inferred← citeshttps://doi.org/10.1007/bfb0045071openalex-snapshot
Constructing a strongly convex superhull of points
inferred← citeshttps://doi.org/10.1007/s002240000067openalex-snapshot
A Randomized Parallel Three-Dimensional Convex Hull Algorithm for Coarse-Grained Multicomputers
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90002-0openalex-snapshot
Finding the convex hull of a sorted point set in parallel
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00160-8openalex-snapshot
Time- and VLSI-optimal convex hull computation on meshes with multiple broadcasting
inferred← citeshttps://doi.org/10.1016/0022-0000(89)90042-1openalex-snapshot
Parallel construction of subdivision hierarchies
inferred← citeshttps://doi.org/10.1016/0196-6774(89)90032-1openalex-snapshot
Triangulating a polygon in parallel
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00036-4openalex-snapshot
Fast randomized parallel methods for planar convex hull construction
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50022-9openalex-snapshot
Parallel Algorithms for Shared-Memory Machines
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50005-xopenalex-snapshot
Deterministic Parallel Computational Geometry
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50019-xopenalex-snapshot
Parallel Computational Geometry: An Approach using Randomization
inferred← citeshttps://doi.org/10.1016/s0167-8191(00)00097-1openalex-snapshot
A 2-D parallel convex hull algorithm with optimal communication phases
inferred← citeshttps://doi.org/10.1016/s0898-1221(97)90055-9openalex-snapshot
Parallel algorithms for regular architectures: Meshes and pyramids
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00009-6openalex-snapshot
Optimal, output-sensitive algorithms for constructing planar hulls in parallel
inferred← citeshttps://doi.org/10.1080/10637199308915433openalex-snapshot
OPTIMAL PARALLEL PREPROCESSING ALGORITHMS FOR TESTING WEAK VISIBILITY OF POLYGONS FROM SEGMENTS
inferred← citeshttps://doi.org/10.1109/12.9737openalex-snapshot
Efficient parallel convex hull algorithms
inferred← citeshttps://doi.org/10.1109/34.16713openalex-snapshot
A bibliography on digital and computational convexity (1961-1988)
inferred← citeshttps://doi.org/10.1109/5.163410openalex-snapshot
Parallel techniques for computational geometry
inferred← citeshttps://doi.org/10.1109/71.363412openalex-snapshot
Efficient geometric algorithms on the EREW PRAM
inferred← citeshttps://doi.org/10.1109/71.506693openalex-snapshot
Square meshes are not optimal for convex hull computation
inferred← citeshttps://doi.org/10.1109/71.737693openalex-snapshot
Optimal parallel algorithms for finding proximate points, with applications
inferred← citeshttps://doi.org/10.1109/71.737694openalex-snapshot
An O((log log n)/sup 2/) time algorithm to compute the convex hull of sorted points on reconfigurable meshes
inferred← citeshttps://doi.org/10.1109/fmpc.1995.380474openalex-snapshot
Time- and VLSI-optimal convex hull computation on meshes with multiple broadcasting
inferred← citeshttps://doi.org/10.1109/icapp.1995.472195openalex-snapshot
A parallel method for finding the convex hull of discs
inferred← citeshttps://doi.org/10.1109/icpp.1993.168openalex-snapshot
Square Meshes are not Optimal for Convex Hull Computation
inferred← citeshttps://doi.org/10.1109/icpp.1994.79openalex-snapshot
Constant-Time Convexity Problems on Dense Reconfigurable Meshes
inferred← citeshttps://doi.org/10.1109/ipps.1997.580962openalex-snapshot
A 2-D parallel convex hull algorithm with optimal communication phases
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365724openalex-snapshot
Parallel algorithms for higher-dimensional convex hulls
inferred← citeshttps://doi.org/10.1137/0218035openalex-snapshot
Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
inferred← citeshttps://doi.org/10.1142/s0218195901000614openalex-snapshot
CONSTRUCTING A STRONGLY CONVEX SUPERHULL OF POINTS
inferred← citeshttps://doi.org/10.1142/s021819599800014xopenalex-snapshot
Determining Weak Visibility of a Polygon from an Edge in Parallel
inferred← citeshttps://doi.org/10.1142/s0218195998000151openalex-snapshot
Finding the Convex Hull of Discs in Parallel
inferred← citeshttps://doi.org/10.1145/10515.10539openalex-snapshot
Efficient plane sweeping in parallel
inferred← citeshttps://doi.org/10.1145/113379.113397openalex-snapshot
In-place techniques for parallel convex hull algorithms (preliminary version)
inferred← citeshttps://doi.org/10.1145/142675.142687openalex-snapshot
Optimal parallel algorithms for triangulated simple polygons
inferred← citeshttps://doi.org/10.1145/142675.142692openalex-snapshot
An optimal parallel algorithm for detecting weak visibility of a simple polygon
inferred← citeshttps://doi.org/10.1145/1869790.1869796openalex-snapshot
Privacy-preserving data-oblivious geometric algorithms for geographic data
inferred← citeshttps://doi.org/10.1145/215399.215410openalex-snapshot
A randomized parallel 3D convex hull algorithm for coarse grained multicomputers
inferred← citeshttps://doi.org/10.1145/2367574.2367578openalex-snapshot
Computational geometry in the parallel external memory model
inferred← citeshttps://doi.org/10.1145/237218.237351openalex-snapshot
Faster output-sensitive parallel convex hulls for d≤3
inferred← citeshttps://doi.org/10.1145/322609.323191openalex-snapshot
Detecting intersection of two convex polygons in parallel
inferred← citeshttps://doi.org/10.1145/3350755.3400255openalex-snapshot
Randomized Incremental Convex Hull is Highly Parallel
inferred← citeshttps://doi.org/10.1145/73393.73414openalex-snapshot
Optimal parallel algorithms for polygon and point-set problems
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.