On the public citation graph
Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets
0 signed · 73 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.1002/prot.340110107openalex-snapshot
Detection of common three‐dimensional substructures in proteins
inferredcites →https://doi.org/10.1007/3-540-62495-3_59openalex-snapshot
Graphs drawn with few crossings per edge
inferredcites →https://doi.org/10.1007/978-3-642-58043-7_12openalex-snapshot
Recent Developments in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf01215922openalex-snapshot
Graphs drawn with few crossings per edge
inferredcites →https://doi.org/10.1007/bf02187783openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and spheres
inferredcites →https://doi.org/10.1007/bf02187910openalex-snapshot
Congruence, similarity, and symmetries of geometric objects
inferredcites →https://doi.org/10.1007/bf02579194openalex-snapshot
Extremal problems in discrete geometry
inferredcites →https://doi.org/10.1016/0022-0000(84)90011-4openalex-snapshot
An n log n algorithm for determining the congruity of polyhedra
inferredcites →https://doi.org/10.1016/0031-3203(91)90073-eopenalex-snapshot
A probabilistic Hough transform
inferredcites →https://doi.org/10.1016/0097-3165(71)90028-8openalex-snapshot
Some extremal problems in geometry
inferredcites →https://doi.org/10.1016/0925-7721(95)00047-xopenalex-snapshot
Geometric pattern matching under Euclidean motion
inferredcites →https://doi.org/10.1016/s0925-7721(98)00008-xopenalex-snapshot
RAPID: Randomized pharmacophore identification for drug design
inferredcites →https://doi.org/10.1080/00029890.1952.11988075openalex-snapshot
On The Different Distances Determined By n Points
inferredcites →https://doi.org/10.1145/177424.177572openalex-snapshot
Practical methods for approximate geometric pattern matching under rigid motions
inferredcites →https://doi.org/10.1145/237218.237240openalex-snapshot
Combinatorial and experimental results for randomized point matching algorithms
inferredcites →https://doi.org/10.1145/41958.41991openalex-snapshot
Congruence, similarity, and symmetries of geometric objects
inferredcites →https://doi.org/10.2307/2307105openalex-snapshot
On the Different Distances Determined by n Points
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4775206openalex-extracted
Optimal Solution to Erdős Distinct Distance Problem
inferred← citeshttps://doi.org/10.1006/cviu.1999.0746openalex-snapshot
Image Analysis and Computer Vision: 1998
inferred← citeshttps://doi.org/10.1007/0-387-25592-3_2openalex-snapshot
Problems and Results on Geometric Patterns
inferred← citeshttps://doi.org/10.1007/0-387-29929-7_7openalex-snapshot
Problems on Repeated Subconfigurations
inferred← citeshttps://doi.org/10.1007/10704703_12openalex-snapshot
Model-Based Object Recognition from a Complex Binary Imagery Using Genetic Algorithm
inferred← citeshttps://doi.org/10.1007/11682462_30openalex-snapshot
An Efficient Approximation Algorithm for Point Pattern Matching Under Noise
inferred← citeshttps://doi.org/10.1007/3-540-44849-7_11openalex-snapshot
An Improved Algorithm for Point Set Pattern Matching under Rigid Motion
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_11openalex-snapshot
Exact Point Pattern Matching and the Number of Congruent Triangles in a Three-Dimensional Pointset
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_6openalex-snapshot
Computing Largest Common Point Sets under Approximate Congruence
inferred← citeshttps://doi.org/10.1007/3-540-47738-1_8openalex-snapshot
On Finding Maximum-Cardinality Symmetric Subsets
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_26openalex-snapshot
Approximation Algorithms for 3-D Common Substructure Identification in Drug and Protein Molecules
inferred← citeshttps://doi.org/10.1007/978-3-540-27798-9_28openalex-snapshot
Algorithms for Point Set Matching with k-Differences
inferred← citeshttps://doi.org/10.1007/978-3-540-27810-8_13openalex-snapshot
Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion
inferred← citeshttps://doi.org/10.1007/978-3-540-75488-6_6openalex-snapshot
Time and Space Efficient Discovery of Maximal Geometric Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-55566-4_36openalex-snapshot
On the Number of Maximal Regular Simplices Determined by n Points in Rd
inferred← citeshttps://doi.org/10.1007/pl00008282openalex-snapshot
Computational Approaches to Drug Design
inferred← citeshttps://doi.org/10.1007/pl00009486openalex-snapshot
On the Maximum Number of Equilateral Triangles, I
inferred← citeshttps://doi.org/10.1007/s00454-001-0010-6openalex-snapshot
Triangles of Extremal Area or Perimeter in a Finite Planar Point Set
inferred← citeshttps://doi.org/10.1007/s00454-002-0727-xopenalex-snapshot
The Number of Congruent Simplices in a Point Set
inferred← citeshttps://doi.org/10.1007/s00454-002-2884-3openalex-snapshot
Combinatorial Geometry Problems in Pattern Recognition
inferred← citeshttps://doi.org/10.1007/s00454-002-2896-zopenalex-snapshot
The k Most Frequent Distances in the Plane
inferred← citeshttps://doi.org/10.1007/s00454-004-1111-9openalex-snapshot
Incidences between Points and Circles in Three and Higher Dimensions
inferred← citeshttps://doi.org/10.1007/s00454-021-00365-6openalex-snapshot
The Maximal Number of 3-Term Arithmetic Progressions in Finite Sets in Different Geometries
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50004-8openalex-snapshot
Discrete Geometric Shapes: Matching, Interpolation, and Approximation**Partially supported by Deutsche Forschungsgemeinschaft (DFG), Grant No. A1 253/4-2.
inferred← citeshttps://doi.org/10.1016/j.knosys.2022.108558openalex-snapshot
A knowledge-based automated driving approach for flexible production of individualized sheet metal parts
inferred← citeshttps://doi.org/10.1016/j.patcog.2006.01.003openalex-snapshot
Simple algorithms for partial point set pattern matching under rigid motion
inferred← citeshttps://doi.org/10.1016/j.patcog.2009.05.014openalex-snapshot
Approximate input sensitive algorithms for point pattern matching
inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00046-9openalex-snapshot
On finding maximum-cardinality symmetric subsets
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00008-xopenalex-snapshot
RAPID: Randomized pharmacophore identification for drug design
inferred← citeshttps://doi.org/10.1017/s0963548314000534openalex-snapshot
Improved Bounds for Incidences Between Points and Circles
inferred← citeshttps://doi.org/10.1089/cmb.2007.r017openalex-snapshot
The MASH Pipeline for Protein Function Prediction and an Algorithm for the Geometric Refinement of 3D Motifs
inferred← citeshttps://doi.org/10.1109/access.2020.2963984openalex-snapshot
Global Adaptive 4-Points Congruent Sets Registration for 3D Indoor Scenes With Robust Estimation
inferred← citeshttps://doi.org/10.1109/icftic57696.2022.10075269openalex-snapshot
3D Registration Method Based On MVFNet And Super4PCS For Nonhomologous Face Pointclouds
inferred← citeshttps://doi.org/10.1109/iis.1997.645168openalex-snapshot
Search techniques for rational drug design
inferred← citeshttps://doi.org/10.1109/ssp.2003.1289460openalex-snapshot
MCMC-based peak template matching for GCXGC
inferred← citeshttps://doi.org/10.1109/tcbb.2012.135openalex-snapshot
Improved Algorithms for Matching r-Separated Sets with Applications to Protein Structure Alignment
inferred← citeshttps://doi.org/10.1109/tkde.2007.190729openalex-snapshot
Localized Co-Occurrence Model for Fast Approximate Search in 3D Structure Databases
inferred← citeshttps://doi.org/10.1112/blms.70452openalex-snapshot
The number of regular simplices in higher dimensions
inferred← citeshttps://doi.org/10.1142/9789812704856_0039openalex-snapshot
ACCURATE CLASSIFICATION OF PROTEIN STRUCTURAL FAMILIES USING COHERENT SUBGRAPH ANALYSIS
inferred← citeshttps://doi.org/10.1142/s0129054106004170openalex-snapshot
ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES
inferred← citeshttps://doi.org/10.1142/s0218195909003118openalex-snapshot
MAXIMIZING THE AREA OF OVERLAP OF TWO UNIONS OF DISKS UNDER RIGID MOTION
inferred← citeshttps://doi.org/10.1145/1247069.1247112openalex-snapshot
Similar simplices in a d-dimensional point set
inferred← citeshttps://doi.org/10.1145/2462356.2462382openalex-snapshot
Improved bounds for incidences between points and circles
inferred← citeshttps://doi.org/10.1145/378583.378587openalex-snapshot
On the number of congruent simplices in a point
inferred← citeshttps://doi.org/10.1145/513400.513416openalex-snapshot
Incidences between points and circles in three and higher dimensions
inferred← citeshttps://doi.org/10.20382/jocg.v5i1a14openalex-snapshot
Incidences with $k$-non-degenerate sets and their applications
inferred← citeshttps://doi.org/10.2298/aadm121212026vopenalex-snapshot
On the sum of the squared multiplicities of the distances in a point set over finite spaces
inferred← citeshttps://doi.org/10.23919/ccc52363.2021.9549486openalex-snapshot
A 4PCS Coarse Registration Algorithm Based on ISS Feature Points
inferred← citeshttps://doi.org/10.48550/arxiv.0809.3539openalex-snapshot
On the sum of the squared multiplicities of the distances in a point set over finite fields
inferred← citeshttps://doi.org/10.7282/t3qj7m8topenalex-snapshot
Some applications of algebraic methods in combinatorial geometry
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.