<--- Back to Details
First PageDocument Content
Discrete geometry / Diagrams / Spanning tree / Voronoi diagram / Triangulation / Proximity problems / Convex hull / Polyhedron / Polygon / Geometry / Mathematics / Computational geometry
Date: 2010-12-10 16:57:56
Discrete geometry
Diagrams
Spanning tree
Voronoi diagram
Triangulation
Proximity problems
Convex hull
Polyhedron
Polygon
Geometry
Mathematics
Computational geometry

Add to Reading List

Source URL: euro.ecom.cmu.edu

Download Document from Source Website

File Size: 1,03 MB

Share Document on Facebook

Similar Documents

Payne : Proximity Loss in Rectangular Conductors with Opposing Currents THE PROXIMITY LOSS IN RECTANGULAR CONDUCTORS WITH OPPOSING CURRENTS There are significant theoretical problems in analysing the proximity loss in r

DocID: 1uMqX - View Document

Computational geometry / Discrete geometry / Convex hull / Delaunay triangulation / Point location / Voronoi diagram / Nearest neighbor search / Motion planning / Line / Proximity problems / Closest pair of points problem

CMSC 754 Computational Geometry1 David M. Mount Department of Computer Science University of Maryland Spring 2012

DocID: 1nPH1 - View Document

Proximity Problems for Point Sets with Low Doubling Dimension by Lee-Ad Gottlieb A dissertation submitted in partial fulfillment

DocID: 1eMLS - View Document

Computational geometry / Nearest neighbor graph / Nearest neighbor search / Connectivity / Delaunay triangulation / Yao graph / Proximity problems / Geometry / Information science / Mathematics

CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in Rd Zahed Rahmati∗

DocID: 18J2i - View Document

Diagrams / Discrete geometry / Voronoi diagram / Triangulation / Medial axis / Delaunay triangulation / Polyhedron / Proximity problems / Convex hull / Geometry / Computational geometry / Mathematics

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Medial Axis Approximation of Planar Shapes from Union of Balls: A Simpler and more Robust Algorithm Joachim Giesen∗

DocID: 18FH3 - View Document