On the public citation graph
Generalized delaunay triangulation for planar graphs
0 signed · 293 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/nme.1620020112openalex-snapshot
Two‐dimensional automatic mesh generation for structural analysis
inferredcites →https://doi.org/10.1002/nme.1620080402openalex-snapshot
Automatic triangulation of arbitrary planar domains for the finite element method
inferredcites →https://doi.org/10.1007/bf00977785openalex-snapshot
Two algorithms for constructing a Delaunay triangulation
inferredcites →https://doi.org/10.1007/bf00993195openalex-snapshot
On finding the convex hull of a simple polygon
inferredcites →https://doi.org/10.1007/bf02187890openalex-snapshot
AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments
inferredcites →https://doi.org/10.1016/0020-0190(72)90045-2openalex-snapshot
An efficient algorith for determining the convex hull of a finite planar set
inferredcites →https://doi.org/10.1016/0020-0190(78)90062-5openalex-snapshot
Triangulating a simple polygon
inferredcites →https://doi.org/10.1016/0020-0190(79)90069-3openalex-snapshot
A linear algorithm for finding the convex hull of a simple polygon
inferredcites →https://doi.org/10.1016/0196-6774(81)90019-5openalex-snapshot
A linear algorithm for computing the visibility polygon from a point
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/0734-189x(83)90065-8openalex-snapshot
Visibility of a simple polygon
inferredcites →https://doi.org/10.1016/b978-0-12-587260-7.50011-xopenalex-snapshot
Software for C1 Surface Interpolation
inferredcites →https://doi.org/10.1090/s0025-5718-1970-0282540-0openalex-snapshot
Triangular Elements in the Finite Element Method
inferredcites →https://doi.org/10.1093/comjnl/19.2.178openalex-snapshot
Two Dimensional Interpolation from Random Data
inferredcites →https://doi.org/10.1109/sfcs.1979.15openalex-snapshot
Efficient computation of continuous skeletons
inferredcites →https://doi.org/10.1109/sfcs.1982.58openalex-snapshot
A theorem on polygon cutting with applications
inferredcites →https://doi.org/10.1109/tc.1984.1676388openalex-snapshot
Computational Geometry—A Survey
inferredcites →https://doi.org/10.1137/0206043openalex-snapshot
Location of a Point in a Planar Subdivision and Its Applications
inferredcites →https://doi.org/10.1137/0210006openalex-snapshot
Generalization of Voronoi Diagrams in the Plane
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/0713021openalex-snapshot
On the Angle Condition in the Finite Element Method
inferredcites →https://doi.org/10.1145/355759.355761openalex-snapshot
Piecewise Quadratic Approximations on Triangles
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cnm.1640101003openalex-snapshot
Reliable Delaunay‐based mesh generation and mesh improvement
inferred← citeshttps://doi.org/10.1002/nla.505openalex-snapshot
Meshing of domains with complex internal geometries
inferred← citeshttps://doi.org/10.1002/nme.3016openalex-snapshot
3D boundary recovery by constrained Delaunay tetrahedralization
inferred← citeshttps://doi.org/10.1002/nme.653openalex-snapshot
Brittle fracture in polycrystalline microstructures with the extended finite element method
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.1006/jagm.1995.1021openalex-snapshot
A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
inferred← citeshttps://doi.org/10.1007/11919476_68openalex-snapshot
Constrained Delaunay Triangulation Using Delaunay Visibility
inferred← citeshttps://doi.org/10.1007/3-540-26772-7_39openalex-snapshot
Semantically Correct 2.5D GIS Data — the Integration of a DTM and Topographic Vector Data
inferred← citeshttps://doi.org/10.1007/3-540-29090-7_9openalex-snapshot
Meshing Piecewise Linear Complexes by Constrained Delaunay Tetrahedralizations
inferred← citeshttps://doi.org/10.1007/3-540-47738-1_19openalex-snapshot
The construction of Delaunay diagrams by lob reduction
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_24openalex-snapshot
A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_11openalex-snapshot
Computing the minimum visible vertex distance between two polygons
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_93openalex-snapshot
Fast algorithms for greedy triangulation
inferred← citeshttps://doi.org/10.1007/3-540-54029-6_163openalex-snapshot
Greedy triangulation approximates the optimum and can be implemented in linear time in the average case
inferred← citeshttps://doi.org/10.1007/3-540-55426-2_41openalex-snapshot
Applying two-dimensional delaunay triangulation to stereo data interpolation
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_82openalex-snapshot
On the relationships among constrained geometric structures
inferred← citeshttps://doi.org/10.1007/3-540-56287-7_98openalex-snapshot
C-sensitive triangulations approximate the minmax length triangulation
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_65openalex-snapshot
A linear-time construction of the relative neighborhood graph within a histogram
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_147openalex-snapshot
Efficient computation of the geodesic Voronoi diagram of points in a simple polygon
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_150openalex-snapshot
Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time
inferred← citeshttps://doi.org/10.1007/978-3-030-23436-2_4openalex-snapshot
A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points
inferred← citeshttps://doi.org/10.1007/978-3-030-76798-3_6openalex-snapshot
On Decomposition of Embedded Prismatoids in $$\mathbb {R}^3$$ Without Additional Points
inferred← citeshttps://doi.org/10.1007/978-3-031-23161-2_394openalex-snapshot
Constrained Edges and Delaunay Triangulation
inferred← citeshttps://doi.org/10.1007/978-3-319-08234-9_394-1openalex-snapshot
Constrained Edges and Delaunay Triangulation
inferred← citeshttps://doi.org/10.1007/978-3-319-44543-4_5openalex-snapshot
Essential Constraints of Edge-Constrained Proximity Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-34958-7_31openalex-snapshot
A Study on Delaunay Terminal Edge Method
inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_32openalex-snapshot
Triangulations of Line Segment Sets in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_59openalex-snapshot
Optimal Triangulation with Steiner Points
inferred← citeshttps://doi.org/10.1007/978-3-642-19391-0_3openalex-snapshot
Counting Plane Graphs with Exponential Speed-Up
inferred← citeshttps://doi.org/10.1007/978-3-642-25878-7_29openalex-snapshot
Triangulations with Circular Arcs
inferred← citeshttps://doi.org/10.1007/978-3-642-33573-0_11openalex-snapshot
Incrementally Constructing and Updating Constrained Delaunay Tetrahedralizations with Finite Precision Coordinates
inferred← citeshttps://doi.org/10.1007/978-3-642-40450-4_22openalex-snapshot
Vertex Deletion for 3D Delaunay Triangulations
inferred← citeshttps://doi.org/10.1007/978-3-642-60718-9_22openalex-snapshot
Construction Of The Constrained Delaunay Triangulation Of A Polygonal Domain
inferred← citeshttps://doi.org/10.1007/978-3-642-78114-8_6openalex-snapshot
Adaptive Range Data Approximation by Constrained Surface Triangulation
inferred← citeshttps://doi.org/10.1007/978-3-642-79210-6_11openalex-snapshot
Surfaces In An Object-Oriented Geometric Framework
inferred← citeshttps://doi.org/10.1007/978-3-7091-2684-4_10openalex-snapshot
Digital Images in Support of Historical Building Data Bases
inferred← citeshttps://doi.org/10.1007/978-3-7091-2830-5_7openalex-snapshot
A Survey of Constrained Delaunay Triangulation Algorithms for Surface Representation
inferred← citeshttps://doi.org/10.1007/978-981-19-4136-8_17openalex-snapshot
TextGen3D: A Real-Time 3D-Mesh Generation with Intersecting Contours for Text
inferred← citeshttps://doi.org/10.1007/bf01188709openalex-snapshot
Duality of constrained Voronoi diagrams and Delaunay triangulations
inferred← citeshttps://doi.org/10.1007/bf01377180openalex-snapshot
Point placement algorithms for Delaunay triangulation of polygonal domains
inferred← citeshttps://doi.org/10.1007/bf01553881openalex-snapshot
Constrained delaunay triangulations
inferred← citeshttps://doi.org/10.1007/bf01553882openalex-snapshot
On the geodesic voronoi diagram of point sites in a simple polygon
inferred← citeshttps://doi.org/10.1007/bf01737163openalex-snapshot
A framework for advancing front techniques of finite element mesh generation
inferred← citeshttps://doi.org/10.1007/bf01901582openalex-snapshot
Algorithm for constrained delaunay triangulation
inferred← citeshttps://doi.org/10.1007/bf01989747openalex-snapshot
Efficiently updating constrained Delaunay triangulations
inferred← citeshttps://doi.org/10.1007/bf01994882openalex-snapshot
Fast algorithms for greedy triangulation
inferred← citeshttps://doi.org/10.1007/bf02187749openalex-snapshot
A linear-time algorithm for computing the voronoi diagram of a convex polygon
inferred← citeshttps://doi.org/10.1007/bf02274210openalex-snapshot
Automatic mesh generation for complex three-dimensional regions using a constrained Delaunay triangulation
inferred← citeshttps://doi.org/10.1007/bf02573974openalex-snapshot
An upper bound for conforming Delaunay triangulations
inferred← citeshttps://doi.org/10.1007/bfb0028250openalex-snapshot
On computing the voronoi diagram for restricted planar figures
inferred← citeshttps://doi.org/10.1007/bfb0042804openalex-snapshot
A space efficient algorithm for the greedy triangulation
inferred← citeshttps://doi.org/10.1007/pl00009199openalex-snapshot
A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains
inferred← citeshttps://doi.org/10.1007/s00366-007-0075-9openalex-snapshot
An algorithm for filling complex holes in reverse engineering
inferred← citeshttps://doi.org/10.1007/s00366-013-0331-0openalex-snapshot
Incrementally constructing and updating constrained Delaunay tetrahedralizations with finite-precision coordinates
inferred← citeshttps://doi.org/10.1007/s003710050175openalex-snapshot
Triangulated spatial models and neighbourhood search: an experimental comparison with quadtrees
inferred← citeshttps://doi.org/10.1007/s00373-013-1320-1openalex-snapshot
Vertex-Colored Encompassing Graphs
inferred← citeshttps://doi.org/10.1007/s00373-015-1546-1openalex-snapshot
Geometric Biplane Graphs I: Maximal Graphs
inferred← citeshttps://doi.org/10.1007/s00453-025-01308-wopenalex-snapshot
The Tight Spanning Ratio of the Rectangle Delaunay Triangulation
inferred← citeshttps://doi.org/10.1007/s00454-007-9032-zopenalex-snapshot
Pre-Triangulations and Liftable Complexes
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-026-00831-zopenalex-snapshot
Optimal Triangulation of Polygons
inferred← citeshttps://doi.org/10.1007/s10109-009-0078-8openalex-snapshot
Simultaneous curve simplification
inferred← citeshttps://doi.org/10.1007/s10109-018-0267-4openalex-snapshot
Precise photorealistic visualization for restoration of historic buildings based on tacheometry data
inferred← citeshttps://doi.org/10.1007/s10707-011-0138-3openalex-snapshot
Generating seamless surfaces for transport and dispersion modeling in GIS
inferred← citeshttps://doi.org/10.1007/s11263-024-02030-wopenalex-snapshot
UrbanEvolver: Function-Aware Urban Layout Regeneration
inferred← citeshttps://doi.org/10.1007/s11431-008-5018-1openalex-snapshot
Integral ear elimination and virtual point-based updating algorithms for constrained Delaunay TIN
inferred← citeshttps://doi.org/10.1016/0004-3702(90)90098-kopenalex-snapshot
Representing stereo data with the Delaunay triangulation
inferred← citeshttps://doi.org/10.1016/0010-4485(92)90011-xopenalex-snapshot
Triangulation of trimmed surfaces in parametric space
inferred← citeshttps://doi.org/10.1016/0010-4485(93)90012-dopenalex-snapshot
Evaluation of a Delaunay-based method for surface approximation
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90043-4openalex-snapshot
Voronoi diagrams with barriers and the shortest diagonal problem
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90122-1openalex-snapshot
A space efficient greedy triangulation algorithm
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90133-gopenalex-snapshot
Optimal time bounds for some proximity problems in the plane
inferred← citeshttps://doi.org/10.1016/0031-3203(91)90064-copenalex-snapshot
Computing the constrained relative neighborhood graphs and constrained gabriel graphs in Euclidean plane
inferred← citeshttps://doi.org/10.1016/0045-7949(93)90239-aopenalex-snapshot
A fast algorithm for generating constrained delaunay triangulations
inferred← citeshttps://doi.org/10.1016/0097-8493(93)90007-vopenalex-snapshot
Algorithm and data structure for triangulating multiply connected polygonal domains
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90019-oopenalex-snapshot
Detecting and decomposing self-overlapping curves
inferred← citeshttps://doi.org/10.1016/0925-7721(93)90001-mopenalex-snapshot
A convex polygon among polygonal obstacles: placement and high-clearance motion
inferred← citeshttps://doi.org/10.1016/1049-9652(92)90076-aopenalex-snapshot
An on-line algorithm for constrained Delaunay triangulation
inferred← citeshttps://doi.org/10.1016/b978-012444816-2/50011-3openalex-snapshot
Geometric Modelling and Spatial Reasoning
inferred← citeshttps://doi.org/10.1016/b978-012692535-7/50088-4openalex-snapshot
Spatial Interpolants for Warping
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/b978-044482537-7/50008-5openalex-snapshot
Applications of Computational Geometry to Geographic Information Systems
inferred← citeshttps://doi.org/10.1016/j.adhoc.2014.08.016openalex-snapshot
Bridge protection algorithms – A technique for fault-tolerance in sensor networks
inferred← citeshttps://doi.org/10.1016/j.advengsoft.2016.05.012openalex-snapshot
Automatic mesh generation for 3D smoothed finite element method (S-FEM) based on the weaken-weak formulation
inferred← citeshttps://doi.org/10.1016/j.apsusc.2024.162262openalex-snapshot
Molecular dynamics simulations of ion adsorption on biphasic calcium phosphate surfaces: Effects of ionic environment and surface morphology
inferred← citeshttps://doi.org/10.1016/j.cad.2010.08.009openalex-snapshot
A robust efficient tracing scheme for triangulating trimmed parametric surfaces
inferred← citeshttps://doi.org/10.1016/j.cag.2005.05.011openalex-snapshot
An algorithm for tetrahedral mesh generation based on conforming constrained Delaunay tetrahedralization
inferred← citeshttps://doi.org/10.1016/j.cma.2009.03.004openalex-snapshot
Conservative interpolation between unstructured meshes via supermesh construction
inferred← citeshttps://doi.org/10.1016/j.comgeo.2006.12.005openalex-snapshot
Pointed binary encompassing trees: Simple and optimal
inferred← citeshttps://doi.org/10.1016/j.comgeo.2007.05.011openalex-snapshot
Local properties of geometric graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.02.005openalex-snapshot
Reprint of: Delaunay refinement algorithms for triangular mesh generation
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.04.006openalex-snapshot
Fast segment insertion and incremental construction of constrained Delaunay triangulations
inferred← citeshttps://doi.org/10.1016/j.comgeo.2023.101983openalex-snapshot
Shortcut hulls: Vertex-restricted outer simplifications of polygons
inferred← citeshttps://doi.org/10.1016/j.compstruc.2010.11.016openalex-snapshot
Three-dimensional constrained boundary recovery with an enhanced Steiner point suppression procedure
inferred← citeshttps://doi.org/10.1016/j.cpc.2013.07.013openalex-snapshot
Molecular dynamics-based unstructured grid generation method for aerodynamic applications
inferred← citeshttps://doi.org/10.1016/j.dam.2014.04.009openalex-snapshot
A note on visibility-constrained Voronoi diagrams
inferred← citeshttps://doi.org/10.1016/j.finel.2009.06.017openalex-snapshot
Constrained Delaunay tetrahedral mesh generation and refinement
inferred← citeshttps://doi.org/10.1016/j.ipl.2014.08.006openalex-snapshot
On triangulation axes of polygons
inferred← citeshttps://doi.org/10.1016/j.isprsjprs.2006.07.005openalex-snapshot
Semantically correct 2.5D GIS data — The integration of a DTM and topographic vector data
inferred← citeshttps://doi.org/10.1016/j.jpowsour.2021.230054openalex-snapshot
Generating characteristic maps of battery cell parameters from sparse input data
inferred← citeshttps://doi.org/10.1016/j.measurement.2020.108197openalex-snapshot
Demodulation of a tilted fibre Bragg grating transmission signal using α-shape modified Delaunay triangulation
inferred← citeshttps://doi.org/10.1016/j.oceaneng.2025.120770openalex-snapshot
A sonar point cloud driven method for underwater steel structure defects inspection
inferred← citeshttps://doi.org/10.1016/j.paerosci.2005.02.002openalex-snapshot
Mesh generation: Art or science?
inferred← citeshttps://doi.org/10.1016/j.tws.2023.110798openalex-snapshot
Estimation of the residual bearing strength of corroded bridge girders using 3D scan data
inferred← citeshttps://doi.org/10.1016/s0010-4485(99)00089-5openalex-snapshot
Incremental tessellation of trimmed parametric surfaces
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80059-5openalex-snapshot
Provably good mesh generation
inferred← citeshttps://doi.org/10.1016/s0097-8493(96)00085-4openalex-snapshot
An improved incremental algorithm for constructing restricted Delaunay triangulations
inferred← citeshttps://doi.org/10.1016/s0278-6125(97)89096-6openalex-snapshot
Reconstruction of volume boundary from layers by triangulation
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00407-8openalex-snapshot
Approximating uniform triangular meshes in polygons
inferred← citeshttps://doi.org/10.1016/s0308-521x(96)00004-2openalex-snapshot
A computerized crop-specific drought monitoring system: Design concepts and initial testing
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00042-6openalex-snapshot
Sequences of spanning trees and a fixed tree theorem
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00047-5openalex-snapshot
Delaunay refinement algorithms for triangular mesh generation
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)89149-3openalex-snapshot
Fast greedy 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.1021/acs.analchem.2c03107openalex-snapshot
Top-Down Approach to Retention Time Prediction in Comprehensive Two-Dimensional Gas Chromatography–Mass Spectrometry
inferred← citeshttps://doi.org/10.1021/acs.chemmater.0c02682openalex-snapshot
First-Principles Hydrothermal Synthesis Design to Optimize Conditions and Increase the Yield of Quaternary Heteroanionic Oxychalcogenides
inferred← citeshttps://doi.org/10.1021/acs.jpcb.0c05791openalex-snapshot
Directing the Diffusion of a Nonmagnetic Nanosized Active Particle with External Magnetic Fields
inferred← citeshttps://doi.org/10.1021/acs.macromol.9b01545openalex-snapshot
Directed Self-Assembly in Diblock Copolymer Thin Films for Uniform Hemisphere Pattern Formation
inferred← citeshttps://doi.org/10.1029/2005wr004365openalex-snapshot
Automated Thiessen polygon generation
inferred← citeshttps://doi.org/10.1038/s41467-025-57193-yopenalex-snapshot
Cecelia: a multifunctional image analysis toolbox for decoding spatial cellular interactions and behaviour
inferred← citeshttps://doi.org/10.1038/s41598-022-16946-1openalex-snapshot
An ANN-based advancing double-front method for automatic isotropic triangle generation
inferred← citeshttps://doi.org/10.1051/matecconf/201817503067openalex-snapshot
MATEC Web of Conferences – General and efficient algorithms for handling intricate situations in trimmed surface rendering
inferred← citeshttps://doi.org/10.1080/02693799308901979openalex-snapshot
Delaunay triangulations in TIN creation: an overview and a linear-time algorithm
inferred← citeshttps://doi.org/10.1080/13658810110074492openalex-snapshot
Comparison of existing triangulation methods for regularly and irregularly spaced height fields
inferred← citeshttps://doi.org/10.1080/13658816.2025.2528964openalex-snapshot
A learning-based parallel geocomputation engine for heterogeneous spatial domain
inferred← citeshttps://doi.org/10.1080/17538947.2024.2390434openalex-snapshot
Graph-based spatial co-location pattern mining: integrate geospatial analysis and logical reasoning
inferred← citeshttps://doi.org/10.1088/2051-672x/ae6ba0openalex-snapshot
On Gaussian filtering of scattered point clouds for surface metrology
inferred← citeshttps://doi.org/10.1093/comjnl/41.2.71openalex-snapshot
Proximity Search with a Triangulated Spatial Model
inferred← citeshttps://doi.org/10.1093/comnet/cnaf040openalex-snapshot
From point patterns to networks: to what extent does the Delaunay triangulation reproduce key spatial and density information?
inferred← citeshttps://doi.org/10.1109/26.237882openalex-snapshot
Topology control for multihop packet radio networks
inferred← citeshttps://doi.org/10.1109/5.163413openalex-snapshot
Automatic mesh generation using the symmetric axis transformation of polygonal domains
inferred← citeshttps://doi.org/10.1109/ccv.1988.589971openalex-snapshot
How the Delaunay Triangulation Can Be used For Representing Stereo Data
inferred← citeshttps://doi.org/10.1109/ciccas.1991.184439openalex-snapshot
A numerical stable algorithm for constructing constrained Delaunay triangulation and application to multichip module layout
inferred← citeshttps://doi.org/10.1109/cisp.2009.5304711openalex-snapshot
Graphics Spatial Conflict Detection Based on the Constrained Delaunay Triangulation
inferred← citeshttps://doi.org/10.1109/das.2016.66openalex-snapshot
Delaunay Triangulation-Based Features for Camera-Based Document Image Retrieval System
inferred← citeshttps://doi.org/10.1109/eecea.2016.7470763openalex-snapshot
Multi-agent approach for on-demand transport problem in a city
inferred← citeshttps://doi.org/10.1109/fscs.1990.89542openalex-snapshot
Provably good mesh generation
inferred← citeshttps://doi.org/10.1109/geoinformatics.2010.5567901openalex-snapshot
Automated point feature label placement using backtracking algorithm with an adjacent graph
inferred← citeshttps://doi.org/10.1109/iccasm.2010.5622336openalex-snapshot
Delaunay triangulation based on nesting island with holes
inferred← citeshttps://doi.org/10.1109/icccn.2003.1284227openalex-snapshot
Topology design for free space optical networks
inferred← citeshttps://doi.org/10.1109/iconstem60960.2024.10568701openalex-snapshot
On Solving Fingerprint Cryptography Using Heptagonal Fuzzy Numbers and Cipher
inferred← citeshttps://doi.org/10.1109/icpr.1988.28293openalex-snapshot
Constrained Delaunay triangulation for multiresolution surface description
inferred← citeshttps://doi.org/10.1109/igarss.2005.1525248openalex-snapshot
Point deletion for dynamic update of CD-TIN
inferred← citeshttps://doi.org/10.1109/ijcnn.2003.1223418openalex-snapshot
A novel vector quantizer for pattern classification tasks
inferred← citeshttps://doi.org/10.1109/infcom.1991.147624openalex-snapshot
A novel topology control for multihop packet radio networks
inferred← citeshttps://doi.org/10.1109/ipps.1994.288190openalex-snapshot
An optimal mesh computer algorithm for constrained Delaunay triangulation
inferred← citeshttps://doi.org/10.1109/isvd.2010.9openalex-snapshot
The Dual is the Context: Spatial Structures for GIS
inferred← citeshttps://doi.org/10.1109/isvd.2011.37openalex-snapshot
Unbiased Curvilinear Structure Extraction for Cartoon Images
inferred← citeshttps://doi.org/10.1109/percom.2008.118openalex-snapshot
An Interference-aware and Power Efficient Topology Control Algorithm for Wireless Multi-hop Networks
inferred← citeshttps://doi.org/10.1109/robot.1988.12326openalex-snapshot
Representing stereo data with the Delaunay triangulation
inferred← citeshttps://doi.org/10.1109/siu.2015.7129842openalex-snapshot
Path planning in a 3D environment created using real world data
inferred← citeshttps://doi.org/10.1109/spi64682.2025.11014326openalex-snapshot
Unified Pre-Processing Steps Reducing the PCB Design Space to Enable ML Applications for Signal and Power Integrity Analysis
inferred← citeshttps://doi.org/10.1109/tcpmt.2025.3597840openalex-snapshot
Relational SI/PI-Database for a Data-Driven Approach to PCB Design Automation and Performance Prediction
inferred← citeshttps://doi.org/10.1109/tetci.2017.2741505openalex-snapshot
A Strategy for Self-Organized Coordinated Motion of a Swarm of Minimalist Robots
inferred← citeshttps://doi.org/10.1109/tgrs.2011.2135371openalex-snapshot
New Advances of the Extended Minimum Cost Flow Phase Unwrapping Algorithm for SBAS-DInSAR Analysis at Full Spatial Resolution
inferred← citeshttps://doi.org/10.1109/tifs.2018.2790953openalex-snapshot
Robust Image Fingerprinting Based on Feature Point Relationship Mining
inferred← citeshttps://doi.org/10.1109/tsipn.2018.2890231openalex-snapshot
Graph-Based Compression for Distributed Particle Filters
inferred← citeshttps://doi.org/10.1109/tvcg.2012.307openalex-snapshot
Computing 2D Constrained Delaunay Triangulation Using the GPU
inferred← citeshttps://doi.org/10.1109/tvcg.2021.3070046openalex-snapshot
Deterministic Linear Time Constrained Triangulation Using Simplified Earcut
inferred← citeshttps://doi.org/10.1111/jmi.12388openalex-snapshot
The finite body triangulation: algorithms, subgraphs, homogeneity estimation and application
inferred← citeshttps://doi.org/10.1117/1.jrs.13.014509openalex-snapshot
Applying time series interferometric synthetic aperture radar and the unscented Kalman filter to predict deformations in Maoxian landslide
inferred← citeshttps://doi.org/10.1117/12.532615openalex-snapshot
Fast algorithms of constrained Delaunay triangulation and skeletonization for band images
inferred← citeshttps://doi.org/10.1134/s106456242370076xopenalex-snapshot
On One Approach to the Estimation of a Triangular Element Degeneration in a Triangulation
inferred← citeshttps://doi.org/10.1137/0913058openalex-snapshot
An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation
inferred← citeshttps://doi.org/10.1137/s0097539702411368openalex-snapshot
Pseudotriangulations from Surfaces and a Novel Type of Edge Flip
inferred← citeshttps://doi.org/10.1137/s0097539795285916openalex-snapshot
Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time
inferred← citeshttps://doi.org/10.1137/s1064827598340500openalex-snapshot
Robust Computational Algorithms for Dynamic Interface Tracking in Three Dimensions
inferred← citeshttps://doi.org/10.1142/s0218195903001244openalex-snapshot
MINIMAL SET OF CONSTRAINTS FOR 2D CONSTRAINED DELAUNAY RECONSTRUCTION
inferred← citeshttps://doi.org/10.1142/s0218195910003219openalex-snapshot
OPTIMAL TRIANGULATIONS OF POINTS AND SEGMENTS WITH STEINER POINTS
inferred← citeshttps://doi.org/10.1142/s0218195992000159openalex-snapshot
POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS
inferred← citeshttps://doi.org/10.1142/s0219876204000149openalex-snapshot
A FEM-BASED MESHFREE METHOD WITH A PROBABILISTIC NODE GENERATION TECHNIQUE
inferred← citeshttps://doi.org/10.1145/1064092.1064107openalex-snapshot
Pointed and colored binary encompassing trees
inferred← citeshttps://doi.org/10.1145/109648.109686openalex-snapshot
Polynomial-size nonobtuse triangulation of polygons
inferred← citeshttps://doi.org/10.1145/112515.112578openalex-snapshot
On good triangulations in three dimensions
inferred← citeshttps://doi.org/10.1145/112515.112581openalex-snapshot
Domain Delaunay Tetrahedrization of arbitrarily shaped curved polyhedra defined in a solid modeling system
inferred← citeshttps://doi.org/10.1145/1137856.1137899openalex-snapshot
Pre-triangulations and liftable complexes
inferred← citeshttps://doi.org/10.1145/116873.116880openalex-snapshot
Voronoi diagrams—a survey of a fundamental geometric data structure
inferred← citeshttps://doi.org/10.1145/142675.142690openalex-snapshot
An upper bound for conforming Delaunay triangulations
inferred← citeshttps://doi.org/10.1145/160985.161008openalex-snapshot
A linear-time randomized algorithm for the bounded Voronoi diagram of a simple polygon
inferred← citeshttps://doi.org/10.1145/177424.177649openalex-snapshot
Fast greedy triangulation algorithms
inferred← citeshttps://doi.org/10.1145/2159616.2159623openalex-snapshot
Computing 2D constrained Delaunay triangulation using the GPU
inferred← citeshttps://doi.org/10.1145/2462356.2462389openalex-snapshot
Fast segment insertion and incremental construction of constrained delaunay triangulations
inferred← citeshttps://doi.org/10.1145/2629697openalex-snapshot
TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator
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/28395.28400openalex-snapshot
A Linear time algorithm for computing the Voronoi diagram of a convex polygon
inferred← citeshttps://doi.org/10.1145/336154.336163openalex-snapshot
Mesh generation for domains with small angles
inferred← citeshttps://doi.org/10.1145/336154.336222openalex-snapshot
Sweep algorithms for constructing higher-dimensional constrained Delaunay triangulations
inferred← citeshttps://doi.org/10.1145/3503953openalex-snapshot
Optimal Area Polygonization by Triangulation and Visibility Search
inferred← citeshttps://doi.org/10.1145/3618352openalex-snapshot
Constrained Delaunay Tetrahedrization: A Robust and Practical Approach
inferred← citeshttps://doi.org/10.1145/3799902.3811042openalex-snapshot
gCDT: A Highly Parallel GPU Algorithm for Large-Scale Constrained Delaunay Triangulation
inferred← citeshttps://doi.org/10.1145/3807503.3819357openalex-snapshot
Graph Signal Processing as an Experimental Approach to Radiomics Analysis
inferred← citeshttps://doi.org/10.1145/3829358openalex-snapshot
Robust Constrained Tetrahedralization with Steiner-point-free Boundaries
showing the first 200 of 267 · page through all 267
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.