Sciweavers

8 search results - page 1 / 2
» Largest Subsets of Triangles in a Triangulation
Sort
View
CCCG
2007
13 years 6 months ago
Largest Subsets of Triangles in a Triangulation
Given a triangulation of n points, with some triangles marked “good”, this paper discusses the problems of computing the largest-area connected set of good triangles that (i) ...
Boris Aronov, Marc J. van Kreveld, Maarten Lö...
CAIP
2007
Springer
132views Image Analysis» more  CAIP 2007»
13 years 11 months ago
Decomposing a Simple Polygon into Trapezoids
Chazelle’s triangulation [1] forms today the common basis for linear-time Euclidean shortest path (ESP) calculations (where start and end point are given within a simple polygon)...
Fajie Li, Reinhard Klette
VIP
2001
13 years 6 months ago
Facial Feature Location with Delaunay Triangulation/Voronoi Diagram Calculation
Facial features determination is essential in many applications such as personal identification, 3D face modeling and model based video coding. Fast and accurate facial feature ex...
Yi Xiao, Hong Yan
BIBE
2007
IEEE
152views Bioinformatics» more  BIBE 2007»
13 years 5 months ago
SBLAST: Structural Basic Local Alignment Searching Tools using Geometric Hashing
While much research has been done on finding similarities between protein sequences, there has not been the same progress on finding similarities between protein structures. Here ...
Tom Milledge, Gaolin Zheng, Tim Mullins, Giri Nara...
VISUALIZATION
1999
IEEE
13 years 9 months ago
Spiraling Edge: Fast Surface Reconstruction from Partially Organized Sample Points
Many applications produce three-dimensional points that must be further processed to generate a surface. Surface reconstruction algorithms that start with a set of unorganized poi...
Patricia Crossno, Edward Angel