Sciweavers

1245 search results - page 38 / 249
» Triangulation for Points on Lines
Sort
View
ENDM
2011
227views Hardware» more  ENDM 2011»
13 years 11 months ago
Bichromatic Triangle Games
We study a combinatorial game called Bichromatic Triangle Game, defined as follows. Two players R and B construct a triangulation on a given planar point set V . Starting from no...
Gordana Manic, Daniel M. Martin, Milos Stojakovic
SODA
2008
ACM
118views Algorithms» more  SODA 2008»
15 years 1 months ago
Geodesic Delaunay triangulation and witness complex in the plane
We introduce a new feature size for bounded domains in the plane endowed with an intrinsic metric. Given a point x in a domain X, the homotopy feature size of X at x measures half...
Jie Gao, Leonidas J. Guibas, Steve Oudot, Yue Wang
ICPR
2010
IEEE
15 years 2 months ago
Triangle-Constraint for Finding More Good Features
We present a novel method for finding more good feature pairs between two sets of features. We first select matched features by Bi-matching method as seed points, then organize th...
Xiaojie Guo, Xiaochun Cao
COMBINATORICS
2004
94views more  COMBINATORICS 2004»
14 years 11 months ago
Even Astral Configurations
A configuration (pq, nk) is a collection of p points and n straight lines in the Euclidean plane so that every point has q straight lines passing through it and every line has k p...
Leah Wrenn Berman
CCCG
2007
15 years 1 months ago
Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment
Here we propose an efficient algorithm for computing the smallest enclosing circle whose center is constrained to lie on a query line segment. Our algorithm preprocesses a given s...
Arindam Karmakar, Sasanka Roy, Sandip Das