Sciweavers

2843 search results - page 263 / 569
» Interpolation by geometric algorithm
Sort
View
VC
2008
167views more  VC 2008»
15 years 2 months ago
A framework for GPU-based application-independent 3D interactions
Abstract Direct manipulation using pointing devices commonly relies on basic interaction tasks such as selection and precise cursor positioning. Traditionally, such tasks use geome...
Harlen Costa Batagelo, Shin-Ting Wu
137
Voted
CVPR
2012
IEEE
13 years 5 months ago
Probabilistic tensor voting for robust perceptual grouping
We address the problem of unsupervised segmentation and grouping in 2D and 3D space, where samples are corrupted by noise, and in the presence of outliers. The problem has attract...
Dian Gong, Gérard G. Medioni
ICPR
2000
IEEE
15 years 7 months ago
Statistical-Based Approach to Word Segmentation
Thispaper presents a text word extraction algorithm that takes a set of bounding boxes of glyphs and their associated text lines of a given document andpartitions the glyphs into ...
Yalin Wang, Robert M. Haralick, Ihsin T. Phillips
COMPGEOM
2007
ACM
15 years 7 months ago
Medial axis approximation from inner Voronoi balls: a demo of the Mesecina tool
We illustrate a simple algorithm for approximating the medial axis of a 2D shape with smooth boundary from a sample of this boundary. The algorithm is compared to a more general a...
Balint Miklos, Joachim Giesen, Mark Pauly
SODA
1996
ACM
121views Algorithms» more  SODA 1996»
15 years 4 months ago
Optimal Placement of Convex Polygons to Maximize Point Containment
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
Matthew Dickerson, Daniel Scharstein