On the public citation graph
Higher-dimensional voronoi diagrams in linear expected time
0 signed · 206 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.1007/bf00535300openalex-snapshot
�ber die konvexe H�lle von n zuf�llig gew�hlten Punkten
inferredcites →https://doi.org/10.1007/bf00535973openalex-snapshot
�ber die konvexe H�lle von n zuf�llig gew�hlten Punkten. II
inferredcites →https://doi.org/10.1007/bf01840356openalex-snapshot
A faster divide-and-conquer algorithm for constructing delaunay triangulations
inferredcites →https://doi.org/10.1007/bf01937482openalex-snapshot
Delaunay triangulation and the convex hull ofn points in expected linear time
inferredcites →https://doi.org/10.1016/0021-9991(78)90110-9openalex-snapshot
Construction of Voronoi polyhedra
inferredcites →https://doi.org/10.1016/0021-9991(79)90146-3openalex-snapshot
A procedure for the construction of Voronoi polyhedra
inferredcites →https://doi.org/10.1016/0021-9991(83)90087-6openalex-snapshot
A new algorithm for three-dimensional voronoi tessellation
inferredcites →https://doi.org/10.1016/0196-6774(85)90017-3openalex-snapshot
Finding the convex hull facet by facet
inferredcites →https://doi.org/10.1088/0031-9112/13/4/008openalex-snapshot
C.R.C. Standard Mathematical Tables
inferredcites →https://doi.org/10.1093/biomet/52.3-4.331openalex-snapshot
The Convex Hull of a Random Set of Points
inferredcites →https://doi.org/10.1093/comjnl/24.2.162openalex-snapshot
Computing Dirichlet tessellations
inferredcites →https://doi.org/10.1093/comjnl/24.2.167openalex-snapshot
Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes
inferredcites →https://doi.org/10.1103/physrev.43.804openalex-snapshot
On the Constitution of Metallic Sodium
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/12130.12172openalex-snapshot
Constructing higher-dimensional convex hulls at logarithmic cost per face
inferredcites →https://doi.org/10.1145/321556.321564openalex-snapshot
An Algorithm for Convex Polytopes
inferredcites →https://doi.org/10.1145/355921.355927openalex-snapshot
Optimal Expected-Time Algorithms for Closest Point Problems
inferredcites →https://doi.org/10.1145/41958.41977openalex-snapshot
On the number of faces in higher-dimensional Voronoi diagrams
inferredcites →https://doi.org/10.1175/1520-0493(1911)39<1082b:pafla>2.0.co;2openalex-snapshot
PRECIPITATION AVERAGES FOR LARGE AREAS
inferredcites →https://doi.org/10.1175/1520-0493(1911)39<1248a:dngb>2.0.co;2openalex-snapshot
DISTRICT NO. 10, GREAT BASIN
inferredcites →https://doi.org/10.1214/aoms/1177704464openalex-snapshot
Random Subdivisions of Space into Crystals
inferredcites →https://doi.org/10.1515/crll.1908.134.198openalex-snapshot
Nouvelles applications des paramètres continus à la théorie des formes quadratiques. Deuxième mémoire. Recherches sur les parallélloèdres primitifs.
inferredcites →https://doi.org/10.2307/2982632openalex-snapshot
A Course in the Geometry of n Dimensions.
inferredcites →https://doi.org/10.2307/2986960openalex-snapshot
A Course in the Geometry of n-Dimensions.
inferredcites →https://doi.org/10.2307/3212146openalex-snapshot
Sur L'enveloppe convexe des nuages de points aleatoires dans R n . I
inferredcites →https://doi.org/10.2307/3214289openalex-snapshot
On the convex hull of random points in a polytope
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jcc.20484openalex-snapshot
An algorithm for three‐dimensional Voronoi S‐network
inferred← citeshttps://doi.org/10.1002/nla.476openalex-snapshot
Acceleration schemes for computing centroidal Voronoi tessellations
inferred← citeshttps://doi.org/10.1002/nme.788openalex-snapshot
Parallel computing of high‐speed compressible flows using a node‐based finite‐element method
inferred← citeshttps://doi.org/10.1002/nme.955openalex-snapshot
Node‐by‐node parallel finite elements: a virtually meshless method
inferred← citeshttps://doi.org/10.1002/prot.22187openalex-snapshot
Protein cutoff scanning: A comparative analysis of cutoff dependent and cutoff free methods for prospecting contacts in proteins
inferred← citeshttps://doi.org/10.1002/rsa.21168openalex-snapshot
The impact of heterogeneity and geometry on the proof complexity of random satisfiability
inferred← citeshttps://doi.org/10.1007/3-540-45545-0_72openalex-snapshot
REGTET: A Program for Computing Regular Tetrahedralizations
inferred← citeshttps://doi.org/10.1007/978-3-030-67307-9_23openalex-snapshot
An Improved Simple Sweep Line Algorithm for Delaunay Refinement Triangulation
inferred← citeshttps://doi.org/10.1007/978-3-030-87615-9_7openalex-snapshot
A Novel Algorithm for Region-to-Region Tractography in Diffusion Tensor Imaging
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_11openalex-snapshot
Constructing Delaunay Triangulations along Space-Filling Curves
inferred← citeshttps://doi.org/10.1007/978-3-642-13642-9openalex-snapshot
Incremental Learning for Motion Prediction of Pedestrians and Vehicles
inferred← citeshttps://doi.org/10.1007/bf01228508openalex-snapshot
A semidynamic construction of higher-order voronoi diagrams and its randomized analysis
inferred← citeshttps://doi.org/10.1007/bf01975867openalex-snapshot
Incremental topological flipping works for regular triangulations
inferred← citeshttps://doi.org/10.1007/bf02770869openalex-snapshot
Voronoi diagrams of random lines and flats
inferred← citeshttps://doi.org/10.1007/bf03549612openalex-snapshot
From Image to Video Approximation by Adaptive Splines over Tetrahedralizations
inferred← citeshttps://doi.org/10.1007/bfb0045072openalex-snapshot
Fast range searching with Delaunay Triangulations
inferred← citeshttps://doi.org/10.1007/pl00009327openalex-snapshot
Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/pl00009505openalex-snapshot
Voronoi Diagrams and Convex Hulls of Random Moving Points
inferred← citeshttps://doi.org/10.1007/s00138-007-0116-9openalex-snapshot
Intentional motion on-line learning and prediction
inferred← citeshttps://doi.org/10.1007/s00138-017-0889-4openalex-snapshot
Almost constant-time 3D nearest-neighbor lookup using implicit octrees
inferred← citeshttps://doi.org/10.1007/s00453-022-01027-6openalex-snapshot
A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes
inferred← citeshttps://doi.org/10.1007/s00454-003-2824-xopenalex-snapshot
Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces
inferred← citeshttps://doi.org/10.1007/s00454-003-2870-4openalex-snapshot
A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces
inferred← citeshttps://doi.org/10.1007/s00454-003-2927-4openalex-snapshot
Nice Point Sets Can Have Nasty Delaunay Triangulations
inferred← citeshttps://doi.org/10.1007/s00454-004-1089-3openalex-snapshot
Dense Point Sets Have Sparse Delaunay Triangulations or ?... But Not Too Nasty?
inferred← citeshttps://doi.org/10.1007/s00454-008-9060-3openalex-snapshot
General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties
inferred← citeshttps://doi.org/10.1007/s00454-020-00235-7openalex-snapshot
Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets
inferred← citeshttps://doi.org/10.1007/s00454-025-00778-7openalex-snapshot
On the Size of Chromatic Delaunay Mosaics
inferred← citeshttps://doi.org/10.1007/s10444-020-09765-3openalex-snapshot
A boundary-partition-based Voronoi diagram of d-dimensional balls: definition, properties, and applications
inferred← citeshttps://doi.org/10.1007/s10596-017-9673-9openalex-snapshot
A space-time adaptive method for reservoir flows: formulation and one-dimensional application
inferred← citeshttps://doi.org/10.1007/s10898-015-0384-2openalex-snapshot
Delaunay-based derivative-free optimization via global surrogates, part I: linear constraints
inferred← citeshttps://doi.org/10.1007/s10898-016-0433-5openalex-snapshot
Delaunay-based derivative-free optimization via global surrogates, part II: convex constraints
inferred← citeshttps://doi.org/10.1007/s11390-014-1475-0openalex-snapshot
On Some Proximity Problems of Colored Sets
inferred← citeshttps://doi.org/10.1016/0020-0255(94)00066-kopenalex-snapshot
Computing nearest neighbor pattern classification perceptrons
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90024-nopenalex-snapshot
On the randomized construction of the Delaunay tree
inferred← citeshttps://doi.org/10.1016/0898-1221(93)90068-7openalex-snapshot
The expected number of k-faces of a Voronoi diagram
inferred← citeshttps://doi.org/10.1016/b978-0-7506-5558-3.x5000-4openalex-snapshot
Neural and Fuzzy Logic Control of Drives and Power Systems
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50006-1openalex-snapshot
Voronoi Diagrams**Partially supported by the Deutsche Forschungsgemeinschaft, grant K1 655 2-2.
inferred← citeshttps://doi.org/10.1016/j.advengsoft.2011.09.003openalex-snapshot
A faster circle-sweep Delaunay triangulation algorithm
inferred← citeshttps://doi.org/10.1016/j.advengsoft.2022.103129openalex-snapshot
An incremental algorithm for simultaneous construction of 2D Voronoi diagram and Delaunay triangulation based on a face-based data structure
inferred← citeshttps://doi.org/10.1016/j.cad.2014.08.013openalex-snapshot
A highly solid model boundary preserving method for large-scale parallel 3D Delaunay meshing on parallel computers
inferred← citeshttps://doi.org/10.1016/j.cad.2023.103563openalex-snapshot
Computing Geometrical Measures of Topological Holes
inferred← citeshttps://doi.org/10.1016/j.cag.2015.07.019openalex-snapshot
Rapid Delaunay triangulation for randomly distributed point cloud data using adaptive Hilbert curve
inferred← citeshttps://doi.org/10.1016/j.comgeo.2021.101821openalex-snapshot
Persistent homology in ℓ∞ metric
inferred← citeshttps://doi.org/10.1016/j.cpc.2016.01.009openalex-snapshot
Voronoi particle merging algorithm for PIC codes
inferred← citeshttps://doi.org/10.1016/j.csda.2019.04.005openalex-snapshot
Fast multivariate log-concave density estimation
inferred← citeshttps://doi.org/10.1016/j.jas.2025.106177openalex-snapshot
On the roads and rivers of Late Iron Age Gaul: Adjusting least-cost path analysis to multiple means of transport and imprecise data
inferred← citeshttps://doi.org/10.1016/j.jcp.2020.109317openalex-snapshot
Moment preserving constrained resampling with applications to particle-in-cell methods
inferred← citeshttps://doi.org/10.1016/j.jmgm.2014.04.004openalex-snapshot
Voxel based parallel post processor for void nucleation and growth analysis of atomistic simulations of material fracture
inferred← citeshttps://doi.org/10.1016/j.jocs.2017.10.019openalex-snapshot
Review of data structures for computationally efficient nearest-neighbour entropy estimators for large systems with periodic boundary conditions
inferred← citeshttps://doi.org/10.1016/j.jpdc.2019.03.011openalex-snapshot
Communication-Free Massively Distributed Graph Generation
inferred← citeshttps://doi.org/10.1016/j.str.2007.10.007openalex-snapshot
MOLE: A Voronoi Diagram-Based Explorer of Molecular Channels, Pores, and Tunnels
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114054openalex-snapshot
The projector algorithm: A simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs
inferred← citeshttps://doi.org/10.1016/s0925-7721(00)00017-1openalex-snapshot
A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case
inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00123-2openalex-snapshot
On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00025-9openalex-snapshot
A comparison of sequential Delaunay triangulation algorithms
inferred← citeshttps://doi.org/10.1016/s0955-7997(03)00097-3openalex-snapshot
Node-based parallel computing of three-dimensional incompressible flows using the free mesh method
inferred← citeshttps://doi.org/10.1017/9781009701259.024openalex-snapshot
A Comparison of Five Implementations of 3D Delaunay Tessellation
inferred← citeshttps://doi.org/10.1017/s1004897900000805openalex-snapshot
Truncated Newton-Based Multigrid Algorithm for Centroidal Voronoi Diagram Calculation
inferred← citeshttps://doi.org/10.1021/ci500273sopenalex-snapshot
DMG-α—A Computational Geometry Library for Multimolecular Systems
inferred← citeshttps://doi.org/10.1023/a:1009857410665openalex-snapshot
Fast Range Searching with Delaunay Triangulations
inferred← citeshttps://doi.org/10.1023/a:1009934225596openalex-snapshot
Exact Computation of Delaunay and Power Triangulations
inferred← citeshttps://doi.org/10.1080/03610919308813149openalex-snapshot
Generating random points in a ball
inferred← citeshttps://doi.org/10.1088/1361-651x/ae0c25openalex-snapshot
Topological modeling of metallic foams
inferred← citeshttps://doi.org/10.1090/conm/453/08794openalex-snapshot
State of the union (of geometric objects)
inferred← citeshttps://doi.org/10.1093/mnras/stx1083openalex-snapshot
Multidimensional upwind hydrodynamics on unstructured meshes using graphics processing units – I. Two-dimensional uniform meshes
inferred← citeshttps://doi.org/10.1093/oxfordhb/9780198854265.013.1openalex-snapshot
Network Methods and Properties
inferred← citeshttps://doi.org/10.1103/physreve.106.024303openalex-snapshot
Cascading traffic jamming in a two-dimensional Motter and Lai model
inferred← citeshttps://doi.org/10.1103/physreve.80.041101openalex-snapshot
Percolation thresholds on two-dimensional Voronoi networks and Delaunay triangulations
inferred← citeshttps://doi.org/10.1109/72.248455openalex-snapshot
Neural network design using Voronoi diagrams
inferred← citeshttps://doi.org/10.1109/81.317962openalex-snapshot
A neural network approach to the construction of Delaunay tessellation of points in R/sup d/
inferred← citeshttps://doi.org/10.1109/access.2024.3456474openalex-snapshot
Incorporating Topological Priors Into Low-Dimensional Visualizations Through Topological Regularization
inferred← citeshttps://doi.org/10.1109/icai58806.2023.10339070openalex-snapshot
An Algorithm for Random Tessellation Using a Steppe Fire Model
inferred← citeshttps://doi.org/10.1109/iccvw60793.2023.00117openalex-snapshot
G2L: A High-Dimensional Geometric Approach for Automatic Generation of Highly Accurate Pseudo-labels
inferred← citeshttps://doi.org/10.1109/icip.2002.1040089openalex-snapshot
HR image from multiframes by Delaunay triangulation: a synopsis
inferred← citeshttps://doi.org/10.1109/icnn.1994.374168openalex-snapshot
Structure training of neural networks
inferred← citeshttps://doi.org/10.1109/icpr.2014.242openalex-snapshot
Incremental Delaunay Triangulation Construction for Clustering
inferred← citeshttps://doi.org/10.1109/ijcnn.1999.832710openalex-snapshot
Neural networks based NARX models in nonlinear adaptive control
inferred← citeshttps://doi.org/10.1109/isvd.2006.30openalex-snapshot
Recent Developments and Open Problems in Voronoi Diagrams
inferred← citeshttps://doi.org/10.1109/isvd.2009.23openalex-snapshot
An Algorithm for Computing Voronoi Diagrams of General Generators in General Normed Spaces
inferred← citeshttps://doi.org/10.1109/percom50583.2021.9439127openalex-snapshot
Density-Based Data Selection and Management for Edge Computing
inferred← citeshttps://doi.org/10.1109/sampta.2017.8024442openalex-snapshot
Sparse approximation of videos by adaptive linear splines over anisotropic tetrahedralizations
inferred← citeshttps://doi.org/10.1109/tcpmt.2019.2918944openalex-snapshot
An Adaptive Sampling Process for Automated Multivariate Macromodeling Based on Hamiltonian-Based Passivity Metrics
inferred← citeshttps://doi.org/10.1109/tip.2002.806234openalex-snapshot
High resolution image formation from low resolution frames using delaunay triangulation
inferred← citeshttps://doi.org/10.1109/tkde.2011.251openalex-snapshot
λ-diverse nearest neighbors browsing for multidimensional data
inferred← citeshttps://doi.org/10.1109/tpami.2018.2889473openalex-snapshot
Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs
inferred← citeshttps://doi.org/10.1111/cgf.14609openalex-snapshot
Constructing L∞ Voronoi Diagrams in 2D and 3D
inferred← citeshttps://doi.org/10.1137/050648699openalex-snapshot
Uniform Convergence of a Nonlinear Energy-Based Multilevel Quantization Scheme
inferred← citeshttps://doi.org/10.1137/1.9781611976465.4openalex-snapshot
The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability
inferred← citeshttps://doi.org/10.1137/1.9781611977066.6openalex-snapshot
Finding Relevant Points for Nearest-Neighbor Classification
inferred← citeshttps://doi.org/10.1137/20m1338721openalex-snapshot
Convergence of Anisotropic Mesh Adaptation via Metric Optimization
inferred← citeshttps://doi.org/10.1142/s0218195903001050openalex-snapshot
PROBABILISTIC ANALYSIS FOR DISCRETE ATTRIBUTES OF MOVING POINTS
inferred← citeshttps://doi.org/10.1142/s0218195905001622openalex-snapshot
GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING
inferred← citeshttps://doi.org/10.1142/s0218195998000138openalex-snapshot
A Robust Implementation for Three-Dimensional Delaunay Triangulations
inferred← citeshttps://doi.org/10.1142/s0219876204000149openalex-snapshot
A FEM-BASED MESHFREE METHOD WITH A PROBABILISTIC NODE GENERATION TECHNIQUE
inferred← citeshttps://doi.org/10.1142/s1793830923500143openalex-snapshot
OFC-Delaunay triangulation: A new efficient algorithm for merging two adjacent Delaunay triangulations
inferred← citeshttps://doi.org/10.1145/140901.141924openalex-snapshot
An efficient expected time parallel algorithm for Voronoi construction
inferred← citeshttps://doi.org/10.1145/142675.142688openalex-snapshot
Incremental topological flipping works for regular triangulations
inferred← citeshttps://doi.org/10.1145/1542362.1542403openalex-snapshot
Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
inferred← citeshttps://doi.org/10.1145/169627.169667openalex-snapshot
A data-parallel algorithm for three-dimensional Delaunay triangulation and its implementation
inferred← citeshttps://doi.org/10.1145/220279.220286openalex-snapshot
A comparison of sequential Delaunay triangulation algorithms
inferred← citeshttps://doi.org/10.1145/237218.237396openalex-snapshot
Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations
inferred← citeshttps://doi.org/10.1145/2556700.2556710openalex-snapshot
A GPU accelerated algorithm for 3D Delaunay triangulation
inferred← citeshttps://doi.org/10.1145/262839.263075openalex-snapshot
Probabilistic analysis for combinatorial functions of moving points
inferred← citeshttps://doi.org/10.1145/276884.276893openalex-snapshot
A condition guaranteeing the existence of higher-dimensional constrained Delaunay triangulations
inferred← citeshttps://doi.org/10.1145/336154.336222openalex-snapshot
Sweep algorithms for constructing higher-dimensional constrained Delaunay triangulations
inferred← citeshttps://doi.org/10.1145/378583.378636openalex-snapshot
Nice point sets can have nasty Delaunay triangulations
inferred← citeshttps://doi.org/10.1145/513400.513419openalex-snapshot
The Delaunay tetrahedralization from Delaunay triangulated surfaces
inferred← citeshttps://doi.org/10.1145/566282.566304openalex-snapshot
A linear bound on the complexity of the delaunay triangulation of points on polyhedral surfaces
inferred← citeshttps://doi.org/10.1145/777792.777824openalex-snapshot
Incremental constructions con BRIO
inferred← citeshttps://doi.org/10.1145/945394.945400openalex-snapshot
Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions
inferred← citeshttps://doi.org/10.1177/0278364915586713openalex-snapshot
Topological trajectory classification with filtrations of simplicial complexes and persistent homology
inferred← citeshttps://doi.org/10.1186/1471-2105-6-207openalex-snapshot
A protein domain interaction interface database: InterPare
inferred← citeshttps://doi.org/10.1186/1758-2946-5-39openalex-snapshot
MOLE 2.0: advanced approach for analysis of biomacromolecular channels
inferred← citeshttps://doi.org/10.1201/9781315119335-66openalex-snapshot
Computational Geometry: Proximity and Location
inferred← citeshttps://doi.org/10.1201/b10626openalex-snapshot
Geometric Data Structures for Computer Graphics
inferred← citeshttps://doi.org/10.13021/mars/6915openalex-snapshot
A multigrid optimization framework for vector quantization
inferred← citeshttps://doi.org/10.1349/ddlp.1799openalex-snapshot
Efficient parallel algorithms for closest point problems.
inferred← citeshttps://doi.org/10.1371/journal.pone.0013942openalex-snapshot
Emergent Properties of Tumor Microenvironment in a Real-Life Model of Multicell Tumor Spheroids
inferred← citeshttps://doi.org/10.1515/advgeom-2015-0045openalex-snapshot
Neighborly inscribed polytopes and delaunay triangulations
inferred← citeshttps://doi.org/10.1533/9780857099518.185openalex-snapshot
The SCCI-Hybrid Method for 2D-Curve Tracing
inferred← citeshttps://doi.org/10.1533/9780857099518.219openalex-snapshot
Interval Versions of Bernstein Polynomials, Bézier Curves and the de Casteljau Algorithm
inferred← citeshttps://doi.org/10.1533/9780857099518.241openalex-snapshot
Robust Computations of Selected Discrete Problems
inferred← citeshttps://doi.org/10.1533/9780857099518.79openalex-snapshot
The Exact Sign of Sum Algorithm (ESSA)
inferred← citeshttps://doi.org/10.1609/aaai.v37i7.25993openalex-snapshot
On Error and Compression Rates for Prototype Rules
inferred← citeshttps://doi.org/10.21248/gups.61035openalex-snapshot
Scalable generation of random graphs
inferred← citeshttps://doi.org/10.2183/pjab.87.115openalex-snapshot
Free Mesh Method: fundamental conception, algorithms and accuracy study
inferred← citeshttps://doi.org/10.22215/etd/2009-06397openalex-snapshot
A ubiquitous GIS: framework, services and algorithms, development
inferred← citeshttps://doi.org/10.3182/20140824-6-za-1003.02090openalex-snapshot
Compression Based Identification of PWA Systems
inferred← citeshttps://doi.org/10.32604/cmc.2021.014984openalex-snapshot
Evaluating the Risk of Disclosure and Utility in a Synthetic Dataset
inferred← citeshttps://doi.org/10.3390/jmse12030453openalex-snapshot
A Novel Vision-Based Outline Extraction Method for Hull Components in Shipbuilding
inferred← citeshttps://doi.org/10.3745/jips.01.0010openalex-snapshot
Survey on 3D Surface Reconstruction
inferred← citeshttps://doi.org/10.3970/cmes.2014.100.031openalex-snapshot
A systematic review of algorithms with linear-time behaviour to generate Delaunay and Voronoi tessellations
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.90-93.3277openalex-snapshot
A Constrained Delaunay Triangulation Algorithm Based on Incremental Points
inferred← citeshttps://doi.org/10.4208/nmtma.2012.m1046openalex-snapshot
Truncated Newton-Based Multigrid Algorithm for Centroidal Voronoi Diagram Calculation
inferred← citeshttps://doi.org/10.48550/arxiv.1603.09320openalex-snapshot
Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1806.09537openalex-snapshot
3/4-discrete optimal transport
inferred← citeshttps://doi.org/10.48550/arxiv.1911.02788openalex-snapshot
Efficient Spatial Nearest Neighbor Queries Based on Multi-layer Voronoi Diagrams
inferred← citeshttps://doi.org/10.48550/arxiv.1912.10094openalex-snapshot
Chart Auto-Encoders for Manifold Structured Data
inferred← citeshttps://doi.org/10.48550/arxiv.2008.02071openalex-snapshot
Persistent Homology in $\ell_{\infty}$ Metric
inferred← citeshttps://doi.org/10.48550/arxiv.2009.01786openalex-snapshot
Computational Analysis of Deformable Manifolds: from Geometric Modelling to Deep Learning
inferred← citeshttps://doi.org/10.48550/arxiv.2012.05751openalex-snapshot
The self-similar evolution of stationary point processes via persistent homology
inferred← citeshttps://doi.org/10.48550/arxiv.2110.09193openalex-snapshot
Topologically Regularized Data Embeddings
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0110030openalex-snapshot
Dense point sets have sparse Delaunay triangulations
inferred← citeshttps://doi.org/10.51466/jeet161-2037sopenalex-snapshot
AVOIDING HEAVY COMPUTATIONS IN INVERSE CALIBRATION PROCEDURE FOR 7 DOF ROBOT MANIPULATOR
inferred← citeshttps://doi.org/10.5281/zenodo.3893142openalex-snapshot
Modelling Three-dimensional fields in geoscience with the Voronoi diagram and its dual
inferred← citeshttps://doi.org/10.5555/313651.313708openalex-snapshot
Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three
inferred← citeshttps://doi.org/10.5555/545381.545397openalex-snapshot
Dense point sets have sparse Delaunay triangulations: or "…but not too nasty"
inferred← citeshttps://doi.org/10.5555/545381.545398openalex-snapshot
Delaunay triangulation programs on surface data
inferred← citeshttps://doi.org/10.5555/982792.982851openalex-snapshot
Almost-Delaunay simplices: nearest neighbor relations for imprecise points
inferred← citeshttps://doi.org/10.5860/choice.44-0357openalex-snapshot
Geometric data structures for computer graphics
inferred← citeshttps://doi.org/10.6028/nist.ir.5164openalex-snapshot
Bibliographic notes on Voronoi diagrams
inferred← citeshttps://doi.org/10.70675/8bd9f0ffz42b9z421fz995az91a273dfd224openalex-snapshot
Expected Size of the 3-Dimensional Delaunay Triangulation of Random Points on a Surface
inferred← citeshttps://doi.org/10.70675/ac7a3e81z9ec3z4877zb72az67161c01aaa2openalex-snapshot
Propagation d’une onde de cavitation en milieux confinés
inferred← citeshttps://doi.org/10.70675/cc966201z7d92z4de4zabc8zbf8370e6f5b0openalex-snapshot
Projection in the 2-Wasserstein sense on structured measure space
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.