Sciweavers

2124 search results - page 206 / 425
» Repairing Structurally Complex Data
Sort
View
IGIS
1994
118views GIS» more  IGIS 1994»
14 years 2 months ago
Surface Modelling with Guaranteed Consistency - An Object-Based Approach
There have been many interpolation methods developed over the years, each with their own problems. One of the biggest limitations in many applications is the non-correspondence of...
Christopher M. Gold, Thomas Roos
CVPR
2003
IEEE
15 years 10 days ago
A 2D Moving Grid Geometric Deformable Model
Geometric deformable models based on the level set method have become very popular in the last several years. To overcome an inherent limitation in accuracy while maintaining comp...
Xiao Han, Chenyang Xu, Jerry L. Prince
DAC
2003
ACM
14 years 11 months ago
An O(nlogn) time algorithm for optimal buffer insertion
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
Weiping Shi, Zhuo Li
ISBI
2006
IEEE
14 years 11 months ago
Towards automated bioimage analysis: from features to semantics
Recent advances in bio-molecular imaging have afforded biologists a more thorough understanding of cellular functions in complex tissue structures. For example, high resolution fl...
B. S. Manjunath, Baris Sumengen, Zhiqiang Bi, Jiyu...
ICCSA
2007
Springer
14 years 4 months ago
Weak Visibility of Two Objects in Planar Polygonal Scenes
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
Mostafa Nouri, Alireza Zarei, Mohammad Ghodsi