Sciweavers

52 search results - page 7 / 11
» General Balanced Subdivision of Two Sets of Points in the Pl...
Sort
View
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 ...
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
INFORMS
1998
100views more  INFORMS 1998»
13 years 7 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...