On the public citation graph

Computational Geometry

0 signed · 35 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.1063/1.4823371openalex-snapshot
Computational Geometry in C
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.
inferredcites →https://doi.org/10.5860/choice.35-6287openalex-snapshot
The algorithm design manual

What points at this work

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

inferred← citeshttps://doi.org/10.1006/gmip.1997.0437openalex-snapshot
Combinatorics and Image Processing
inferred← citeshttps://doi.org/10.1006/gmip.1998.0465openalex-snapshot
The Crust and the β-Skeleton: Combinatorial Curve Reconstruction
inferred← citeshttps://doi.org/10.1006/jath.1998.3306openalex-snapshot
Piecewise Smooth Spaces in Duality: Application to Blossoming
inferred← citeshttps://doi.org/10.1007/3-540-10856-4_78openalex-snapshot
The art of dynamizing
inferred← citeshttps://doi.org/10.1007/978-3-642-24999-0_63openalex-snapshot
Biarc Approximation of Planar Algebraic Curve
inferred← citeshttps://doi.org/10.1007/bf00977785openalex-snapshot
Two algorithms for constructing a Delaunay triangulation
inferred← citeshttps://doi.org/10.1007/bf02187688openalex-snapshot
Computing circular separability
inferred← citeshttps://doi.org/10.1007/bf02187718openalex-snapshot
AnO(n logn) algorithm for the all-nearest-neighbors Problem
inferred← citeshttps://doi.org/10.1007/bf02187810openalex-snapshot
Toughness and Delaunay triangulations
inferred← citeshttps://doi.org/10.1007/s11075-004-3642-9openalex-snapshot
Blossoming stories
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00111-uopenalex-snapshot
On the complexity of some basic problems in computational convexity: I. Containment problems
inferred← citeshttps://doi.org/10.1016/0097-8493(85)90029-9openalex-snapshot
Computer graphics and computer vision—Some unifying and discriminating features
inferred← citeshttps://doi.org/10.1016/j.jat.2008.08.015openalex-snapshot
Bregman distances and Klee sets
inferred← citeshttps://doi.org/10.1016/j.jhevol.2019.05.013openalex-snapshot
Poggetti Vecchi (Tuscany, Italy): A late Middle Pleistocene case of human–elephant interaction
inferred← citeshttps://doi.org/10.1016/s0004-3702(98)00076-9openalex-snapshot
Detecting geometric infeasibility
inferred← citeshttps://doi.org/10.1016/s0096-3003(97)10043-1openalex-snapshot
An approximate algorithm for computing multidimensional convex hulls
inferred← citeshttps://doi.org/10.1016/s0097-8493(99)00093-xopenalex-snapshot
Interactive ray tracing with the visibility complex
inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00069-1openalex-snapshot
Ring, torus and hypercube architectures/algorithms for parallel computing
inferred← citeshttps://doi.org/10.1016/s0264-8172(97)00015-9openalex-snapshot
Techniques for including large deformations associated with salt and fault motion in basin modeling
inferred← citeshttps://doi.org/10.1016/s1570-579x(06)80007-8openalex-snapshot
Ready-to-Blossom Bases in Chebyshev Spaces
inferred← citeshttps://doi.org/10.1109/icma.2014.6885810openalex-snapshot
Research on hull configuration method of curve and surface based on NURBS
inferred← citeshttps://doi.org/10.1109/infcom.2012.6195558openalex-snapshot
Geometric algorithms for target localization and tracking under location uncertainties in wireless sensor networks
inferred← citeshttps://doi.org/10.1109/tai.2021.3103143openalex-snapshot
Bipartite Cooperative Coevolution for Energy-Aware Coverage Path Planning of UAVs
inferred← citeshttps://doi.org/10.1109/tevc.2021.3095156openalex-snapshot
Growing and Evolving 3-D Prints
inferred← citeshttps://doi.org/10.1109/tim.2022.3188033openalex-snapshot
Surface Defect Detection of Heat Sink Based on Lightweight Fully Convolutional Network
inferred← citeshttps://doi.org/10.1145/3603719.3603732openalex-snapshot
Indexing Temporal Relations for Range-Duration Queries
inferred← citeshttps://doi.org/10.11606/d.45.2016.tde-25072016-184451openalex-snapshot
Algoritmos para união de círculos e polígonos
inferred← citeshttps://doi.org/10.11606/t.11.2020.tde-12082020-165438openalex-snapshot
Sensoriamento remoto para identificação taxonômica e mapeamento de espécies arbóreas em ambiente urbano
inferred← citeshttps://doi.org/10.1201/b10620-9openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1631/jzus.2006.a2043openalex-snapshot
A new extension algorithm for cubic B-splines based on minimal strain energy
inferred← citeshttps://doi.org/10.21203/rs.3.rs-860574/v1openalex-snapshot
Robust Semi-Automatic Annotation of object Data Sets with Bounding Rectangles.
inferred← citeshttps://doi.org/10.6028/nist.ir.89-4100openalex-snapshot
On the expected complexity of the 3-dimensional voronoi diagram
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.