On the public citation graph

Topological Structure Extraction for Computing Surface-Surface Intersection Curves

0 signed · 23 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.1006/gmod.2001.0553openalex-extracted
The Intersection of Two Ringed Surfaces and Some Related Problems
inferredcites →https://doi.org/10.1007/978-3-642-04074-0openalex-extracted
Shape Interrogation for Computer Aided Design and Manufacturing
inferredcites →https://doi.org/10.1007/bf02519033openalex-extracted
NURBS approximation of surface/surface intersection curves
inferredcites →https://doi.org/10.1007/bf02960775openalex-extracted
A tracing algorithm for surface-surface intersections on surface boundaries
inferredcites →https://doi.org/10.1016/0010-4485(89)90058-4openalex-extracted
Improved test for closed loops in surface intersections
inferredcites →https://doi.org/10.1016/0010-4485(90)90011-zopenalex-extracted
Method for intersecting algebraic surfaces with rational polynomial patches
inferredcites →https://doi.org/10.1016/0167-8396(86)90005-1openalex-extracted
Surface algorithms using bounds on derivatives
inferredcites →https://doi.org/10.1016/0167-8396(88)90010-6openalex-extracted
Tracing surface intersections
inferredcites →https://doi.org/10.1016/j.cad.2008.11.008openalex-extracted
Approximation of surface-to-surface intersection curves within a prescribed error bound satisfying continuity
inferredcites →https://doi.org/10.1016/j.cad.2020.102866openalex-extracted
Surface–Surface-Intersection Computation Using a Bounding Volume Hierarchy with Osculating Toroidal Patches in the Leaf Nodes
inferredcites →https://doi.org/10.1016/j.cad.2022.103303openalex-extracted
Computing the Intersection of Two Rational Surfaces Using Matrix Representations
inferredcites →https://doi.org/10.1016/j.cagd.2008.03.003openalex-extracted
Classification and resolution of critical cases in Grandine and Klein's topology determination using a perturbation method
inferredcites →https://doi.org/10.1016/j.cagd.2009.01.004openalex-extracted
A torus patch approximation approach for point projection on surfaces
inferredcites →https://doi.org/10.1016/j.cagd.2012.03.004openalex-extracted
Fast B-spline curve fitting by L-BFGS
inferredcites →https://doi.org/10.1016/j.jcde.2015.05.001openalex-extracted
A graph-based method for fitting planar B-spline curves with intersections
inferredcites →https://doi.org/10.1016/s0167-8396(96)00024-6openalex-extracted
A new approach to the surface intersection problem
inferredcites →https://doi.org/10.1016/s0360-8352(97)00196-4openalex-extracted
An evolutionary method for general surface-surface intersection problems
inferredcites →https://doi.org/10.1080/10867651.2004.10504896openalex-extracted
Ray Bilinear Patch Intersections
inferredcites →https://doi.org/10.1080/16864360.2004.10738287openalex-extracted
Surface to Surface Intersections
inferredcites →https://doi.org/10.1117/1.2151127openalex-extracted
New curve-tracing algorithm based on a minimum-spanning-tree model and regularized fuzzy clustering
inferredcites →https://doi.org/10.1145/1138450.1138453openalex-extracted
Fitting B-spline curves to point clouds by curvature-based squared distance minimization
inferredcites →https://doi.org/10.1504/ijcat.2007.014557openalex-extracted
A tracing method for parametric Bezier triangular surface/plane intersection
inferredcites →https://doi.org/10.5860/choice.31-6094openalex-extracted
Fundamentals of computer aided geometric design
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.