The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Convex hulls of finite sets of points in two and three dimensions
Communications of the ACM
Optimal Search in Planar Subdivisions
Optimal Search in Planar Subdivisions
Computational geometry.
Computing convolutions by reciprocal search
SCG '86 Proceedings of the second annual symposium on Computational geometry
Storing the subdivision of a polyhedral surface
SCG '86 Proceedings of the second annual symposium on Computational geometry
SCG '86 Proceedings of the second annual symposium on Computational geometry
Topologically sweeping an arrangement
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Worst-case optimal hidden-surface removal
ACM Transactions on Graphics (TOG)
A Linear time algorithm for computing the Voronoi diagram of a convex polygon
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Finding the visibility graph of a simple polygon in time proportional to its size
SCG '87 Proceedings of the third annual symposium on Computational geometry
Primitives for the manipulation of three-dimensional subdivisions
SCG '87 Proceedings of the third annual symposium on Computational geometry
Polygon properties calculated from the vertex neighborhoods
SCG '87 Proceedings of the third annual symposium on Computational geometry
Numerical stability of geometric algorithms
SCG '87 Proceedings of the third annual symposium on Computational geometry
ACM Transactions on Graphics (TOG)
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Representing geometric structures in d dimensions: topology and order
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Subdivisions of n-dimensional spaces and n-dimensional generalized maps
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Triangulating a non-convex polytype
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Incremental computation of planar maps
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
ACM Transactions on Graphics (TOG)
The implementation of an algorithm to find the convex hull of a set of three-dimensional points
ACM Transactions on Graphics (TOG)
IEEE Transactions on Computers
ACM Transactions on Mathematical Software (TOMS)
Generalized B-spline surfaces of arbitrary topology
SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
An O(n2log n) time algorithm for the MinMax angle triangulation
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
On solving geometric optimization problems using shortest paths
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Efficient Delaunay triangulation using rational arithmetic
ACM Transactions on Graphics (TOG)
The weighted region problem: finding shortest paths through a weighted planar subdivision
Journal of the ACM (JACM)
Dynamic trees and dynamic point location
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Numerical stability of algorithms for line arrangements
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Optimality of the Delaunay triangulation in Rd
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Design methodology of boundary data structures
SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Visibility-ordering meshed polyhedra
ACM Transactions on Graphics (TOG)
Reconciling environment integration and software evolution
ACM Transactions on Software Engineering and Methodology (TOSEM)
An upper bound for conforming Delaunay triangulations
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Numerical stability of algorithms for 2D Delaunay triangulations
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Intersection detection and separators for simple polygons
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Three-dimensional alpha shapes
VVS '92 Proceedings of the 1992 workshop on Volume visualization
An optimal algorithm for intersecting line segments in the plane
Journal of the ACM (JACM)
Three-dimensional alpha shapes
ACM Transactions on Graphics (TOG)
ACM Transactions on Graphics (TOG)
On the topological shape of planar Voronoi diagrams
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Efficient exact arithmetic for computational geometry
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
A model for n-dimensional boundary topology
SMA '93 Proceedings on the second ACM symposium on Solid modeling and applications
Combining hierarchical radiosity and discontinuity meshing
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Dimension-independent modeling with simplicial complexes
ACM Transactions on Graphics (TOG)
Vertical decompositions for triangles in 3-space
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Piecewise-linear interpolation between polygonal slices
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Spheres, molecules, and hidden surface removal
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
VVS '94 Proceedings of the 1994 symposium on Volume visualization
Software caching and computation migration in Olden
PPOPP '95 Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming
Computation of the Medial Axis Transform of 3-D polyhedra
SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
A comparison of sequential Delaunay triangulation algorithms
Proceedings of the eleventh annual symposium on Computational geometry
Overlaying simply connected planar subdivisions in linear time
Proceedings of the eleventh annual symposium on Computational geometry
Hierarchical triangulation for multiresolution surface description
ACM Transactions on Graphics (TOG)
Static analysis yields efficient exact integer arithmetic for computational geometry
ACM Transactions on Graphics (TOG)
Robust adaptive floating-point geometric predicates
Proceedings of the twelfth annual symposium on Computational geometry
Developing a practical projection-based parallel Delaunay algorithm
Proceedings of the twelfth annual symposium on Computational geometry
Proceedings of the twelfth annual symposium on Computational geometry
Robust proximity queries: an illustration of degree-driven algorithm design
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
A perturbation scheme for spherical arrangements with application to molecular modeling
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Separating an object from its cast
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
A new algorithm for computing shortest paths in weighted planar subdivisions (extended abstract)
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Snap rounding line segments efficiently in two and three dimensions
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
IEEE Transactions on Computers
Structural operators for modeling 3-manifolds
SMA '97 Proceedings of the fourth ACM symposium on Solid modeling and applications
Discrete Voronoi Diagrams and the SKIZ Operator: A Dynamic Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
Designing a data structure for polyhedral surfaces
Proceedings of the fourteenth annual symposium on Computational geometry
MAPS: multiresolution adaptive parameterization of surfaces
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Proceedings of the fifth ACM symposium on Solid modeling and applications
Crust and anti-crust: a one-step boundary and skeleton extraction algorithm
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
A new and simple algorithm for quality 2-dimensional mesh generation
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Fast and accurate hierarchical radiosity using global visibility
ACM Transactions on Graphics (TOG)
Maintenance of a minimum spanning forest in a dynamic planar graph
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Applying parallel processing techniques to classification problems in constructive solid geometry
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A practical algorithm for computing the Delaunay triangulation for convex distance functions
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Triangulations in CGAL (extended abstract)
Proceedings of the sixteenth annual symposium on Computational geometry
Linear-time triangulation of a simple polygon made easier via randomization
Proceedings of the sixteenth annual symposium on Computational geometry
ACM Transactions on Graphics (TOG)
Face fixer: compressing polygon meshes with properties
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
A parallel dynamic-mesh Lagrangian method for simulation of flows with dynamic interfaces
Proceedings of the 2000 ACM/IEEE conference on Supercomputing
A software engineering perspective on algorithmics
ACM Computing Surveys (CSUR)
Proceedings of the sixth ACM symposium on Solid modeling and applications
Out-of-core build of a topological data structure from polygon soup
Proceedings of the sixth ACM symposium on Solid modeling and applications
Proceedings of the sixth ACM symposium on Solid modeling and applications
Hierarchical morse complexes for piecewise linear 2-manifolds
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Supporting dynamic data structures with Olden
Compiler optimizations for scalable parallel systems
Texture synthesis over arbitrary manifold surfaces
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Coding polygon meshes as compressable ASCII
Proceedings of the seventh international conference on 3D Web technology
Proceedings of the 2002 ACM SIGGRAPH/Eurographics symposium on Computer animation
Subdivision-based multilevel methods for large scale engineering simulation of thin shells
Proceedings of the seventh ACM symposium on Solid modeling and applications
Write barrier removal by static analysis
OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Opening the black box: interactive hierarchical clustering for multivariate spatial patterns
Proceedings of the 10th ACM international symposium on Advances in geographic information systems
Regular triangulations of dynamic sets of points
Computer Aided Geometric Design
Fast Range Searching with Delaunay Triangulations
Geoinformatica
Star-vertices: a compact representation for planar meshes with adjacency information
Journal of Graphics Tools
An Algorithm for the Medial Axis Transform of 3D Polyhedral Solids
IEEE Transactions on Visualization and Computer Graphics
IEEE Computer Graphics and Applications
Delaunay Triangulation Using a Uniform Grid
IEEE Computer Graphics and Applications
Topological Invariants for Lines
IEEE Transactions on Knowledge and Data Engineering
TIN Meets CAD - Extending the TIN Concept in GIS
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
Modified DAG Location for Delaunay Triangulation
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
Parallel 2D Delaunay Triangulations in HPF and MPI
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
An Improved Algorithm for Subdivision Traversal without Extra Storage
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Designing and Implementing a General Purpose Halfedge Data Structure
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Non-manifold Decomposition in Arbitrary Dimensions
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Graphical Models - Pacific graphics 2001
An improved procedure for 2D unstructured Delaunay mesh generation
Advances in Engineering Software
Optimal and suboptimal robust algorithms for proximity graphs
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
Planar minimally rigid graphs and pseudo-triangulations
Proceedings of the nineteenth annual symposium on Computational geometry
CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Topology Optimal Transformation for Reconstructing 3-Dimensional Mandible Structure
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Delete and insert operations in Voronoi/Delaunay methods and applications
Computers & Geosciences
A scalable data structure for three-dimensional non-manifold objects
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Decomposing non-manifold objects in arbitrary dimensions
Graphical Models - Special issue: Discrete topology and geometry for image and object representation
Techniques for visualizing 3-dimensional manifolds
VIS '90 Proceedings of the 1st conference on Visualization '90
A minimal and complete set of operators for the development of robust manifold mesh modelers
Graphical Models - Special issue on SMI 2002
Journal of Functional Programming
Purely Functional Data Structures by Chris Okasaki, Cambridge University Press, 1998, 220pp.
Journal of Functional Programming
Incremental Penetration Depth Estimation between Convex Polytopes Using Dual-Space Expansion
IEEE Transactions on Visualization and Computer Graphics
A probabilistic approach to inference with limited information in sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Parallel Delaunay triangulation based on circum-circle criterion
SCCG '03 Proceedings of the 19th spring conference on Computer graphics
Scalable peer-to-peer networked virtual environment
Proceedings of 3rd ACM SIGCOMM workshop on Network and system support for games
Expected time analysis for Delaunay point location
Computational Geometry: Theory and Applications
Compatible Triangulations of Spatial Decompositions
VIS '04 Proceedings of the conference on Visualization '04
TIN meets CAD: extending the TIN concept in GIS
Future Generation Computer Systems - Special issue: Geocomputation
Contour interpolation by straight skeletons
Graphical Models
HCPO: an efficient insertion order for incremental Delaunay triangulation
Information Processing Letters
Proceedings of the 2005 ACM symposium on Solid and physical modeling
Certifying and constructing minimally rigid graphs in the plane
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Planar minimally rigid graphs and pseudo-triangulations
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
ACM SIGGRAPH 2005 Papers
Calculating the meeting point of scattered robots on weighted terrain surfaces
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Monitoring dynamic spatial fields using responsive geosensor networks
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Photorealistic lighting with offset radiance transfer mapping
I3D '06 Proceedings of the 2006 symposium on Interactive 3D graphics and games
Tight bounds for connecting sites across barriers
Proceedings of the twenty-second annual symposium on Computational geometry
Timing-constrained and voltage-island-aware voltage assignment
Proceedings of the 43rd annual Design Automation Conference
Geometric modeling based on triangle meshes
ACM SIGGRAPH 2006 Courses
Delaunay partitions in Rn applied to non-convex programs and vertex/facet enumeration problems
Computers and Operations Research
Connected & manifold Sierpinsky polyhedra
SM '04 Proceedings of the ninth ACM symposium on Solid modeling and applications
On the stabbing number of a random Delaunay triangulation
Computational Geometry: Theory and Applications
Computer-Aided Design
Solid and physical modeling with chain complexes
Proceedings of the 2007 ACM symposium on Solid and physical modeling
Emulating mobile ad-hoc networks of hand-held devices: the OCTOPUS virtual environment
MobiEval '07 Proceedings of the 1st international workshop on System evaluation for mobile platforms
Transactions and privatization in Delaunay triangulation
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Data structures for simplicial complexes: an analysis and a comparison
SGP '05 Proceedings of the third Eurographics symposium on Geometry processing
Molecular surfaces on proteins via beta shapes
Computer-Aided Design
International Journal of Computer Applications in Technology
Postplacement voltage assignment under performance constraints
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Morphological mesh filtering and α-objects
Pattern Recognition Letters
Topological triangle characterization with application to object detection from images
Image and Vision Computing
Efficient terrain triangulation and modification algorithms for game applications
International Journal of Computer Games Technology - Joint International Conference on Cyber Games and Interactive Entertainment 2006
Describing shapes by geometrical-topological properties of real functions
ACM Computing Surveys (CSUR)
Visual analytics of spatial interaction patterns for pandemic decision support
International Journal of Geographical Information Science - Geovisual Analytics for Spatial Decision Support
Actuation Constraints and Artificial Physics Control
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
MIDIAS: An Integrated 2D/3D Sensor System for Safety Applications
ACIVS '08 Proceedings of the 10th International Conference on Advanced Concepts for Intelligent Vision Systems
Consistency constraints and 3D building reconstruction
Computer-Aided Design
An O(n5/2logn) algorithm for the Rectilinear Minimum Link-Distance Problem in three dimensions
Computational Geometry: Theory and Applications
The Voronoi Diagram of Circles and Its Application to the Visualization of the Growth of Particles
Transactions on Computational Science III
Cyclic plain-weaving on polygonal mesh surfaces with graph rotation systems
ACM SIGGRAPH 2009 papers
Journal of Computational Physics
On converting sets of tetrahedra to combinatorial and PL manifolds
Computer Aided Geometric Design
SOT: compact representation for tetrahedral meshes
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
Mesh cutting during real-time physical simulation
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
Planar minimally rigid graphs and pseudo-triangulations
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Robust uniform triangulation algorithm for computer aided design
Computer-Aided Design
An efficient sweep-line Delaunay triangulation algorithm
Computer-Aided Design
Computer Aided Geometric Design
Efficient substitutes for subdivision surfaces
ACM SIGGRAPH 2009 Courses
HCPO: an efficient insertion order for incremental Delaunay triangulation
Information Processing Letters
A multiple substructure matching algorithm for fingerprint verification
CIARP'07 Proceedings of the Congress on pattern recognition 12th Iberoamerican conference on Progress in pattern recognition, image analysis and applications
Proceedings of the twenty-sixth annual symposium on Computational geometry
Spatial embedding and spatial context
QuaCon'09 Proceedings of the 1st international conference on Quality of context
A simplex-based approach to implement dimension independent spatial analyses
Computers & Geosciences
Calibration and low-level data fusion algorithms for a parallel 2D/3D-camera
Information Fusion
Haptic rendering with predictive representation of local geometry
HAPTICS'04 Proceedings of the 12th international conference on Haptic interfaces for virtual environment and teleoperator systems
Algorithms and theory of computation handbook
3D surface reconstruction of objects by using stereoscopic viewing
ASM'10 Proceedings of the 4th international conference on Applied mathematics, simulation, modelling
ISVC'10 Proceedings of the 6th international conference on Advances in visual computing - Volume Part II
Navigation queries from triangular meshes
MIG'10 Proceedings of the Third international conference on Motion in games
LR: compact connectivity representation for triangle meshes
ACM SIGGRAPH 2011 papers
Kinetic line Voronoi operations and their reversibility
Transactions on computational science IX
Kinetic line Voronoi operations and their reversibility
Transactions on computational science IX
Mesh cutting during real-time physical simulation
Computer-Aided Design
wNeighbors: a method for finding k nearest neighbors in weighted regions
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
The stochastic walk algorithms for point location in pseudo-triangulations
Advances in Engineering Software
Dynamic hierarchical triangulation of a clustered data stream
Computers & Geosciences
A faster circle-sweep Delaunay triangulation algorithm
Advances in Engineering Software
Dynamic isoline extraction for visualization of streaming data
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Oversimplified euler operators for a non-oriented, non-manifold b-rep data structure
ISVC'05 Proceedings of the First international conference on Advances in Visual Computing
Feature-based interactively sketched terrain
I3D '12 Proceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games
GIScience'06 Proceedings of the 4th international conference on Geographic Information Science
Representing topological structures using cell-chains
GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing
A new sub-pixel map for image analysis
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
Formal study of plane delaunay triangulation
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Explicit array-based compact data structures for triangulations
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Computational Geometry: Theory and Applications
Delaunay refinement algorithms for triangular mesh generation
Computational Geometry: Theory and Applications
A review on delaunay refinement techniques
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I
Zipper: A compact connectivity data structure for triangle meshes
Computer-Aided Design
Compact combinatorial maps in 3d
CVM'12 Proceedings of the First international conference on Computational Visual Media
Compact combinatorial maps: A volume mesh data structure
Graphical Models
Fast segment insertion and incremental construction of constrained delaunay triangulations
Proceedings of the twenty-ninth annual symposium on Computational geometry
SMI 2013: Towards building smart self-folding structures
Computers and Graphics
Technical note: Linear algebraic representation for topological structures
Computer-Aided Design
Reprint of: Extreme point and halving edge search in abstract order types
Computational Geometry: Theory and Applications
Finite Element/Fictitious Domain programming for flows with particles made simple
Advances in Engineering Software
Hi-index | 0.01 |
The following problem is discussed: given n points in the plane (the sites) and an arbitrary query point q, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the griven sites and then locating the query point inone of its regions. Two algorithms are given, one that constructs the Voronoi diagram in O(n log n) time, and another that inserts a new sit on O(n) time. Both are based on the use of the Voronoi dual, or Delaunay triangulation, and are simple enough to be of practical value. the simplicity of both algorithms can be attributed to the separation of the geometrical and topological aspects of the problem and to the use of two simple but powerful primitives, a geometric predicate and an operator for manipulating the topology of the diagram. The topology is represented by a new data structure for generalized diagrams, that is, embeddings of graphs in two-dimensional manifolds. This structure represents simultaneously an embedding, its dual, and its mirror image. Furthermore, just two operators are sufficients for building and modifying arbitrary diagrams.