515 search results - page 20 / 103 » Classroom Examples of Robustness Problems in Geometric Compu... |
121
click to vote
SIGGRAPH
1999
ACM
15 years 8 months ago
1999
ACM
In this paper, we develop methods to rapidly remove rough features from irregularly triangulated data intended to portray a smooth surface. The main task is to remove undesirable ...
145
click to vote
COMPGEOM
2001
ACM
15 years 7 months ago
2001
ACM
This presentation illustrates examples of my geometric sculpture and outlines certain design techniques. I apply methods from the field of computational geometry to the creation o...
139
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
115
Voted
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper, an efficient algorithm is presented for solving the 2-D optimization problem which is associated with computing the robustness measures of a number of linear time-in...
160
click to vote
CVPR
2010
IEEE
16 years 3 days ago
2010
IEEE
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embedd...