On the public citation graph

Computational geometry in a curved world

https://doi.org/10.1007/bf01840397
0 signed · 111 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/3-540-19488-6_107openalex-snapshot
Algorithms for planar geometric models
inferredcites →https://doi.org/10.1007/978-1-4613-8713-8_4openalex-snapshot
Computational Geometry and Software Engineering
inferredcites →https://doi.org/10.1007/bf01762127openalex-snapshot
Decomposition and intersection of simple splinegons
inferredcites →https://doi.org/10.1007/bfb0012765openalex-snapshot
Fast detection of polyhedral intersections
inferredcites →https://doi.org/10.1016/0020-0190(81)90091-0openalex-snapshot
Testing a simple polygon for monotonicity
inferredcites →https://doi.org/10.1016/0196-6774(83)90013-5openalex-snapshot
Finding the convex hull of a simple polygon
inferredcites →https://doi.org/10.1016/0196-6774(85)90007-0openalex-snapshot
A linear algorithm for determining the separation of convex polyhedra
inferredcites →https://doi.org/10.1016/0196-6774(87)90028-9openalex-snapshot
Convex hulls of piecewise-smooth Jordan curves
inferredcites →https://doi.org/10.1016/0304-3975(82)90120-7openalex-snapshot
Fast detection of polyhedral intersection
inferredcites →https://doi.org/10.1016/s0019-9958(86)80033-xopenalex-snapshot
Sorting jordan sequences in linear time using level-linked search trees
inferredcites →https://doi.org/10.1109/sfcs.1977.6openalex-snapshot
Applications of a planar separator theorem
inferredcites →https://doi.org/10.1137/0136016openalex-snapshot
A Separator Theorem for Planar Graphs
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferredcites →https://doi.org/10.1137/0215023openalex-snapshot
Optimal Point Location in a Monotone Subdivision
inferredcites →https://doi.org/10.1137/0217010openalex-snapshot
An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
inferredcites →https://doi.org/10.1145/322139.322142openalex-snapshot
An Optimal Algorithm for Finding the Kernel of a Polygon
inferredcites →https://doi.org/10.1145/325165.325225openalex-snapshot
Techniques for conic splines
inferredcites →https://doi.org/10.1145/356827.356833openalex-snapshot
Representations for Rigid Solids: Theory, Methods, and Systems
inferredcites →https://doi.org/10.1145/357314.357315openalex-snapshot
Curve Fitting with Conic Splines
inferredcites →https://doi.org/10.1145/357337.357341openalex-snapshot
Triangulating Simple Polygons and Equivalent Problems
inferredcites →https://doi.org/10.1145/6138.6151openalex-snapshot
Planar point location using persistent search trees
inferredcites →https://doi.org/10.1145/73393.73404openalex-snapshot
Recipes for geometry and numerical analysis - Part I: an empirical study
inferredcites →https://doi.org/10.1145/7531.24036openalex-snapshot
Intersection of convex objects in two and three dimensions
inferredcites →https://doi.org/10.1145/800116.803772openalex-snapshot
Geometric complexity

What points at this work

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

inferred← citeshttps://doi.org/10.1006/gmod.2001.0546openalex-snapshot
The Convex Hull of Rational Plane Curves
inferred← citeshttps://doi.org/10.1007/1-4020-0611-x_142openalex-snapshot
Computational geometry
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_19openalex-snapshot
A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_100openalex-snapshot
On determining optimal strategies in pursuit games in the plane
inferred← citeshttps://doi.org/10.1007/978-1-4419-1153-7_142openalex-snapshot
Computational Geometry
inferred← citeshttps://doi.org/10.1007/978-1-4613-0459-3_3openalex-snapshot
C
inferred← citeshttps://doi.org/10.1007/978-3-030-04651-4_12openalex-snapshot
Computing a Rectilinear Shortest Path amid Splinegons in Plane
inferred← citeshttps://doi.org/10.1007/978-3-032-10554-7_24openalex-snapshot
Automatic Marker Placement Method for Marker-Based Virtual Reality
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_49openalex-snapshot
Jacobi Curves: Computing the Exact Topology of Arrangements of Non-singular Algebraic Curves
inferred← citeshttps://doi.org/10.1007/978-3-540-46515-7_20openalex-snapshot
Polygonal Approximations for Curved Problems: An Application to Arrangements
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_33openalex-snapshot
Computational and Structural Advantages of Circular Boundary Representation
inferred← citeshttps://doi.org/10.1007/978-3-642-61542-9_20openalex-snapshot
Containment Algorithms for Objects in Rectangular Boxes
inferred← citeshttps://doi.org/10.1007/978-3-7091-0587-0_14openalex-snapshot
The Convex Hull of Freeform Surfaces
inferred← citeshttps://doi.org/10.1007/978-4-431-68204-2_28openalex-snapshot
Primitive Geometric Operations on Planar Algebraic Curves with Gaussian Approximation
inferred← citeshttps://doi.org/10.1007/978-981-95-7127-7_33openalex-snapshot
Trajectory Visibility at First Sight
inferred← citeshttps://doi.org/10.1007/bf01759058openalex-snapshot
Convex hulls of objects bounded by algebraic curves
inferred← citeshttps://doi.org/10.1007/bfb0032047openalex-snapshot
Determining the separation of preprocessed polyhedra — A unified approach
inferred← citeshttps://doi.org/10.1007/s00025-025-02479-2openalex-snapshot
Computing Shortest Paths Amid Non-overlapping Weighted Disks
inferred← citeshttps://doi.org/10.1007/s00224-011-9337-4openalex-snapshot
Simple Wriggling is Hard Unless You Are a Fat Hippo
inferred← citeshttps://doi.org/10.1007/s004530010042openalex-snapshot
A Unified Approach to Conic Visibility
inferred← citeshttps://doi.org/10.1007/s00607-003-0055-xopenalex-snapshot
The Convex Hull of Freeform Surfaces
inferred← citeshttps://doi.org/10.1007/s10878-020-00524-0openalex-snapshot
Computing an $$L_1$$ shortest path among splinegonal obstacles in the plane
inferred← citeshttps://doi.org/10.1007/s11786-012-0111-zopenalex-snapshot
On Computing the Convex Hull of (Piecewise) Curved Objects
inferred← citeshttps://doi.org/10.1016/0004-3702(88)90054-9openalex-snapshot
An algorithmic approach to some problems in terrain navigation
inferred← citeshttps://doi.org/10.1016/0010-4485(88)90040-1openalex-snapshot
Putting objects into boxes
inferred← citeshttps://doi.org/10.1016/0010-4485(91)90086-copenalex-snapshot
Data structures to support Bézier-based modelling
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90104-6openalex-snapshot
Oracle complexities for computational geometry of semi-algebraic sets and Voronoi diagrams
inferred← citeshttps://doi.org/10.1016/0045-7949(95)00205-7openalex-snapshot
Symbolic math applications to constructive solid geometry and finite element analysis
inferred← citeshttps://doi.org/10.1016/0165-0114(94)00301-mopenalex-snapshot
α-Kernel problem with fuzzy visibility
inferred← citeshttps://doi.org/10.1016/0167-8396(91)90001-ropenalex-snapshot
Detecting the intersection of convex objects in the plane
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90019-popenalex-snapshot
Shortest curves in planar regions with curved boundary
inferred← citeshttps://doi.org/10.1016/0925-7721(93)90031-zopenalex-snapshot
Linear-time algorithms for weakly-monotone polygons
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00022-4openalex-snapshot
Computing grasp functions
inferred← citeshttps://doi.org/10.1016/1049-9660(91)90020-popenalex-snapshot
Image analysis and computer vision: 1990
inferred← citeshttps://doi.org/10.1016/1049-9660(92)90011-qopenalex-snapshot
Computing stable poses of piecewise smooth objects
inferred← citeshttps://doi.org/10.1016/j.cad.2011.03.007openalex-snapshot
The shortest path in a simply-connected domain having a curved boundary
inferred← citeshttps://doi.org/10.1016/j.cad.2012.12.003openalex-snapshot
Shortest path in a multiply-connected domain having curved boundaries
inferred← citeshttps://doi.org/10.1016/j.cad.2013.08.041openalex-snapshot
Precise convex hull computation for freeform models using a hierarchical Gauss map and a Coons bounding volume hierarchy
inferred← citeshttps://doi.org/10.1016/j.cag.2011.03.028openalex-snapshot
Efficient convex hull computation for planar freeform curves
inferred← citeshttps://doi.org/10.1016/j.cagd.2019.04.010openalex-snapshot
Arc fibrations of planar domains
inferred← citeshttps://doi.org/10.1016/j.cagd.2021.101966openalex-snapshot
Representing planar domains by polar parameterizations with parabolic parameter lines
inferred← citeshttps://doi.org/10.1016/j.cagd.2022.102075openalex-snapshot
Detection and computation of conservative kernels of models consisting of freeform curves and surfaces, using inequality constraints
inferred← citeshttps://doi.org/10.1016/j.cagd.2023.102205openalex-snapshot
Kernel-based construction operators for Boolean sum and ruled geometry
inferred← citeshttps://doi.org/10.1016/j.cagd.2024.102316openalex-snapshot
Voronoi-based splinegon decomposition and shortest-path tree computation
inferred← citeshttps://doi.org/10.1016/j.cagd.2026.102536openalex-snapshot
Arc-fibration kernels of arc-spline domains
inferred← citeshttps://doi.org/10.1016/j.cam.2013.07.006openalex-snapshot
Weak visibility polygons of NURBS curves inside simple polygons
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.02.007openalex-snapshot
An exact and efficient approach for computing a cell in an arrangement of quadrics
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.11.002openalex-snapshot
Guarding curvilinear art galleries with vertex or point guards
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.07.002openalex-snapshot
Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.04.004openalex-snapshot
A tight bound for point guards in piecewise convex art galleries
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.10.004openalex-snapshot
α -Visibility
inferred← citeshttps://doi.org/10.1016/j.comgeo.2017.07.001openalex-snapshot
Visibility graphs, dismantlability, and the cops and robbers game
inferred← citeshttps://doi.org/10.1016/j.eswa.2015.09.034openalex-snapshot
A linear time algorithm for minimum conic link path in a simple polygon
inferred← citeshttps://doi.org/10.1016/j.jestch.2021.03.002openalex-snapshot
Path planning of a mobile robot among curved obstacles through tangent drawing and trapezoidal decomposition
inferred← citeshttps://doi.org/10.1016/s0167-8655(00)00087-8openalex-snapshot
3-D localization and feature recovering through CAD-based stable pose calculation
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00229-6openalex-snapshot
On determining optimal strategies in pursuit games in the plane
inferred← citeshttps://doi.org/10.1108/17563781211255853openalex-snapshot
Terrain based co‐operative UAV mapping of complex obstacles using 2‐D splinegon
inferred← citeshttps://doi.org/10.1109/70.406944openalex-snapshot
Manipulating algebraic parts in the plane
inferred← citeshttps://doi.org/10.1109/acc.2008.4586662openalex-snapshot
Airborne mapping of complex obstacles using 2D Splinegon
inferred← citeshttps://doi.org/10.1109/cadvis.1991.148759openalex-snapshot
Computing stable poses of piecewise smooth objects
inferred← citeshttps://doi.org/10.1109/cvpr.1992.223265openalex-snapshot
Computing curvilinear structure by token-based grouping
inferred← citeshttps://doi.org/10.1109/imtc.2008.4547087openalex-snapshot
Pythagorean Hodograph (PH) Path Planning for Tracking Airborne Contaminant using Sensor Swarm
inferred← citeshttps://doi.org/10.1109/jsen.2008.2004298openalex-snapshot
Contaminant cloud boundary monitoring using network of UAV sensors
inferred← citeshttps://doi.org/10.1109/robot.1990.125994openalex-snapshot
Gaussian approximations of objects bounded by algebraic curves
inferred← citeshttps://doi.org/10.1109/robot.1991.131724openalex-snapshot
Motion planning with planar geometric models
inferred← citeshttps://doi.org/10.1109/tim.2009.2028760openalex-snapshot
Airborne Vehicle Mapping of Curvilinear Objects Using 2-D Splinegon
inferred← citeshttps://doi.org/10.1115/1.1286054openalex-snapshot
Swept Surface Synthesis With Visibility
inferred← citeshttps://doi.org/10.1117/12.25506openalex-snapshot
Algorithmic approaches to optimal route planning
inferred← citeshttps://doi.org/10.1137/0221038openalex-snapshot
Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions
inferred← citeshttps://doi.org/10.1137/080744694openalex-snapshot
Line Transversals of Convex Polyhedra in $\mathbb{R}^3$
inferred← citeshttps://doi.org/10.1142/s0218195903001128openalex-snapshot
A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature Amidst Moderate Obstacles
inferred← citeshttps://doi.org/10.1142/s0218195911003548openalex-snapshot
COMPUTATIONAL AND STRUCTURAL ADVANTAGES OF CIRCULAR BOUNDARY REPRESENTATION
inferred← citeshttps://doi.org/10.1142/s0218195998000047openalex-snapshot
An Output-Sensitive Convex Hull Algorithm for Planar Objects
inferred← citeshttps://doi.org/10.1145/12130.12170openalex-snapshot
A linear-time algorithm for triangulating simple polygons
inferred← citeshttps://doi.org/10.1145/237218.237393openalex-snapshot
A polynomial-time algorithm for computing a shortest path of bounded curvature amidst moderate obstacles (extended abstract)
inferred← citeshttps://doi.org/10.1145/2462356.2462377openalex-snapshot
Computing shortest paths among curved obstacles in the plane
inferred← citeshttps://doi.org/10.1145/2493132.2462377openalex-snapshot
Computing shortest paths among curved obstacles in the plane
inferred← citeshttps://doi.org/10.1145/2660771openalex-snapshot
Computing Shortest Paths among Curved Obstacles in the Plane
inferred← citeshttps://doi.org/10.1145/98524.98600openalex-snapshot
On solving geometric optimization problems using shortest paths
inferred← citeshttps://doi.org/10.1177/0278364906060133openalex-snapshot
Relative Position Computation for Assembly Planning With Planar Toleranced Parts
inferred← citeshttps://doi.org/10.1243/09544100jaero585openalex-snapshot
Co-operative unmanned aerial vehicle searching and mapping of complex obstacles using two-dimensional splinegon
inferred← citeshttps://doi.org/10.2514/6.2007-6761openalex-snapshot
Contaminant Cloud Boundary Monitoring Using UAV Sensor Swarms
inferred← citeshttps://doi.org/10.2514/6.2008-6320openalex-snapshot
Co-Operative Unmanned Aerial Vehicle Mapping of Complex Obstacles Using 2-D Splinegon
inferred← citeshttps://doi.org/10.3166/ejc.15.441-448openalex-snapshot
Multi UAV Coordination for Tracking the Dispersion of a Contaminant Cloud in an Urban Region
inferred← citeshttps://doi.org/10.3182/20080706-5-kr-1001.00964openalex-snapshot
Dubins Path Planning of Multiple UAVs for Tracking Contaminant Cloud
inferred← citeshttps://doi.org/10.3182/20091006-3-us-4006.00002openalex-snapshot
Monitoring the Dispersion of a Contaminant Cloud in an Urban Region by a Swarm of UAV Sensors
inferred← citeshttps://doi.org/10.5220/0002204804130416openalex-snapshot
COOPERATIVE UAVS MAPPING COMPLEX ENVIRONMENT USING 2D SPLINEGON
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.