Sciweavers

86 search results - page 11 / 18
» Generalized Balanced Partitions of Two Sets of Points in the...
Sort
View
COMGEO
2011
ACM
13 years 2 months ago
On crossing numbers of geometric proximity graphs
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...
Bernardo M. Ábrego, Ruy Fabila Monroy, Silv...
JCO
2010
169views more  JCO 2010»
13 years 5 months ago
An almost four-approximation algorithm for maximum weight triangulation
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
Shiyan Hu
CCCG
2006
13 years 8 months ago
On Planar Path Transformation
A flip or edge-replacement is considered as a transformation by which one edge e of a geometric object is removed and an edge f (f = e) is inserted such that the resulting object ...
Kamrul Islam, Selim G. Akl, Henk Meijer
COLT
2004
Springer
14 years 22 days ago
An Inequality for Nearly Log-Concave Distributions with Applications to Learning
Abstract— We prove that given a nearly log-concave distribution, in any partition of the space to two well separated sets, the measure of the points that do not belong to these s...
Constantine Caramanis, Shie Mannor
ICCV
2005
IEEE
14 years 29 days ago
Surface Parameterization Using Riemann Surface Structure
We propose a general method that parameterizes general surfaces with complex (possible branching) topology using Riemann surface structure. Rather than evolve the surface geometry...
Yalin Wang, Xianfeng Gu, Kiralee M. Hayashi, Tony ...