On the public citation graph

Sweep Methods for Parallel Computational Geometry

https://doi.org/10.1007/bf01941685

0 signed · 67 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-3-642-61568-9openalex-snapshot

Algorithms in Combinatorial Geometry

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

Parallel computational geometry

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

Fractional cascading: I. A data structuring technique

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

Stabbing line segments

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

New algorithms for special cases of the hidden line elimination problem

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

An input-size/output-size trade-off in the time-complexity of rectilinear hidden surface removal

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

On parallel hashing and integer sorting

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

Deterministic parallel list ranking

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

The contour problem for rectilinear polygons

inferredcites →https://doi.org/10.1016/0020-0190(87)90159-1openalex-snapshot

Time- and space-optimal contour computation for a set of rectangles

inferredcites →https://doi.org/10.1016/0020-0190(90)90062-3openalex-snapshot

Hidden line elimination for isooriented rectangles

inferredcites →https://doi.org/10.1016/0022-0000(85)90008-xopenalex-snapshot

Routing, merging, and sorting on parallel models of computation

inferredcites →https://doi.org/10.1016/0196-6774(80)90011-5openalex-snapshot

Finding the contour of a union of iso-oriented rectangies

inferredcites →https://doi.org/10.1016/0196-6774(82)90008-6openalex-snapshot

An O(logn) parallel connectivity algorithm

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

An O(n2log n) parallel max-flow algorithm

inferredcites →https://doi.org/10.1016/0196-6774(84)90013-0openalex-snapshot

An optimal contour algorithm for iso-oriented rectangles

inferredcites →https://doi.org/10.1016/0196-6774(84)90027-0openalex-snapshot

Optimal algorithms to compute the closure of a set of iso-rectangles

inferredcites →https://doi.org/10.1016/0196-6774(89)90017-5openalex-snapshot

A simple parallel tree contraction algorithm

inferredcites →https://doi.org/10.1016/0304-3975(78)90051-8openalex-snapshot

Finding the intersection of two convex polyhedra

inferredcites →https://doi.org/10.1016/0743-7315(86)90011-0openalex-snapshot

Efficient parallel solutions to some geometric problems

inferredcites →https://doi.org/10.1016/s0734-189x(87)80114-7openalex-snapshot

New algorithms for special cases of the hidden line elimination problem

inferredcites →https://doi.org/10.1109/sfcs.1984.715896openalex-snapshot

Finding biconnected componemts and computing tree functions in logarithmic parallel time

inferredcites →https://doi.org/10.1109/sfcs.1985.43openalex-snapshot

Parallel tree contraction and its application

inferredcites →https://doi.org/10.1109/sfcs.1986.10openalex-snapshot

Approximate and exact parallel scheduling with applications to list, tree and graph problems

inferredcites →https://doi.org/10.1109/sfcs.1986.41openalex-snapshot

Parallel merge sort

inferredcites →https://doi.org/10.1109/sfcs.1988.21975openalex-snapshot

An optimal algorithm for intersecting line segments in the plane

inferredcites →https://doi.org/10.1109/sfcs.1989.63477openalex-snapshot

Sorting on a parallel pointer machine with applications to set expression evaluation

inferredcites →https://doi.org/10.1109/sfcs.1992.267792openalex-snapshot

Optimal parallel hull construction for simple polygons in O(log log n) time

inferredcites →https://doi.org/10.1109/tc.1980.1675470openalex-snapshot

Set Membership Classification: A Unified Approach to Geometric Intersection Problems

inferredcites →https://doi.org/10.1109/tc.1980.1675628openalex-snapshot

An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles

inferredcites →https://doi.org/10.1109/tc.1983.1676138openalex-snapshot

Searching, Merging, and Sorting in Parallel Computation

inferredcites →https://doi.org/10.1109/tc.1984.1676388openalex-snapshot

Computational Geometry—A Survey

inferredcites →https://doi.org/10.1109/tc.1985.6312202openalex-snapshot

The power of parallel prefix

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

Set Merging Algorithms

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

Parallelism in Comparison Problems

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

An Efficient Parallel Biconnectivity Algorithm

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

Parallel Merge Sort

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

Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms

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

Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors

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

Making data structures persistent

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

A polyhedron representation for computer vision

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

Parallel algorithms for evaluating sequences of set-manipulation operations

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

Dynamic parallel complexity of computational circuits

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

The Parallel Evaluation of General Arithmetic Expressions

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

Parallel Prefix Computation

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

A Characterization of Ten Hidden-Surface Algorithms

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

Representations for Rigid Solids: Theory, Methods, and Systems

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

A null-object detection algorithm for constructive solid geometry

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

Intersecting line segments in parallel with an output-sensitive number of processors

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

Hidden surface removal for rectangles

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

An efficient output-sensitive hidden surface removal algorithm and its parallelization

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

Binary partitions with applications to hidden surface removal and solid modelling

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

Intersecting is easier than sorting

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

Computational Geometry--An Introduction.

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

Algorithms in Combinatorial Geometry.

inferredcites →https://doi.org/10.5555/320176.320189openalex-snapshot

Applying parallel processing techniques to classification problems in constructive solid geometry

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-45545-0_75openalex-snapshot

Parallel Optimal Weighted Links

inferred← citeshttps://doi.org/10.1007/978-3-030-12274-4_6openalex-snapshot

OpenACC Based GPU Parallelization of Plane Sweep Algorithm for Geometric Intersection

inferred← citeshttps://doi.org/10.1007/978-3-319-46766-5_9openalex-snapshot

Implementing Maps: Map2D

inferred← citeshttps://doi.org/10.1007/978-3-642-00212-0_4openalex-snapshot

Parallel Optimal Weighted Links

inferred← citeshttps://doi.org/10.1007/s00371-021-02185-4openalex-snapshot

Stripped halfedge data structure for parallel computation of arrangements of segments

inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50005-xopenalex-snapshot

Deterministic Parallel Computational Geometry

inferred← citeshttps://doi.org/10.1016/j.orl.2005.02.004openalex-snapshot

Locating two obnoxious facilities using the weighted maximin criterion

inferred← citeshttps://doi.org/10.1109/compsac.2019.00136openalex-snapshot

Parallelization of Plane Sweep Based Voronoi Construction with Compiler Directives

inferred← citeshttps://doi.org/10.1109/ipdps49936.2021.00032openalex-snapshot

Euler Meets GPU: Practical Graph Algorithms with Theoretical Guarantees

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

A Practical Algorithm for Enumerating Collinear Points

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.