Proximity problems - PDFSEARCH.IO - Document Search Engine

Proximity problems
Results: 26

#	Item
1	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 Add to Reading List Source URL: g3rbj.co.uk Language: English - Date: 2017-07-31 08:34:06
2	CMSC 754 Computational Geometry1 David M. Mount Department of Computer Science University of Maryland Spring 2012 Add to Reading List Source URL: www.cs.umd.edu Language: English - Date: 2012-05-21 17:04:35 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
3	Proximity Problems for Point Sets with Low Doubling Dimension by Lee-Ad Gottlieb A dissertation submitted in partial fulfillment Add to Reading List Source URL: cs.nyu.edu - Date: 2009-04-20 17:54:37
4	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∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-17 10:55:30 Computational geometry Nearest neighbor graph Nearest neighbor search Connectivity Delaunay triangulation Yao graph Proximity problems Geometry Information science Mathematics
5	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∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:24:37 Diagrams Discrete geometry Voronoi diagram Triangulation Medial axis Delaunay triangulation Polyhedron Proximity problems Convex hull Geometry Computational geometry Mathematics
6	A Framework For Efficient Minimum Distance Computations By David E. Johnson and Elaine Cohen Department of Computer Science, University of Utah, Salt Lake City, UT 84112 Add to Reading List Source URL: www.cs.utah.edu Language: English - Date: 1998-12-11 15:34:19 Collision detection Bounding volume Software development Mathematical optimization Proximity problems Mathematics Minimum bounding box Computational geometry Dimension 3D computer graphics Video game development Operations research
7	On k-Enclosing Objects in a Coloured Point Set Luis Barba∗ Stephane Durocher†‡ Debajyoti Mondal† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 Discrete mathematics Computational geometry Diagrams Voronoi diagram Proximity problems Time complexity Largest empty rectangle Smallest circle problem Mathematics Theoretical computer science Discrete geometry
8	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∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:28:32 Diagrams Discrete geometry Voronoi diagram Triangulation Medial axis Delaunay triangulation Polyhedron Proximity problems Convex hull Geometry Computational geometry Mathematics
9	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Molecular graphs of a finite points set : a generalization of the Delaunay triangulation M. Melkemi LIRIS, Universit´e Claude Bernard Lyon 1, Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:36 Graph theory Computational geometry Voronoi diagram Delaunay triangulation Alpha shape Godfried Toussaint Proximity problems Molecular graph Convex hull Geometry Mathematics Triangulation
10	Collision and Proximity Queries Dinesh Manocha (based on slides from Ming Lin) COMP790-058 Fall 2013 Add to Reading List Source URL: gamma.cs.unc.edu Language: English - Date: 2013-09-26 11:50:56 Computational geometry Voronoi diagram Mathematics Polyhedron Proximity problems Pitteway triangulation Geometry Diagrams Discrete geometry