Sciweavers

2188 search results - page 250 / 438
» Instance-Optimal Geometric Algorithms
Sort
View
138
Voted
ICPR
2010
IEEE
15 years 6 months ago
Triangle-Constraint for Finding More Good Features
We present a novel method for finding more good feature pairs between two sets of features. We first select matched features by Bi-matching method as seed points, then organize th...
Xiaojie Guo, Xiaochun Cao
ASPDAC
2005
ACM
111views Hardware» more  ASPDAC 2005»
15 years 5 months ago
Placement with symmetry constraints for analog layout design using TCG-S
In order to handle device matching for analog circuits, some pairs of modules need to be placed symmetrically with respect to a common axis. In this paper, we deal with the module...
Jai-Ming Lin, Guang-Ming Wu, Yao-Wen Chang, Jen-Hu...
122
Voted
COMPGEOM
2008
ACM
15 years 5 months ago
Delpsc: a delaunay mesher for piecewise smooth complexes
This video presents the working of a new algorithm/software called DelPSC that meshes piecewise smooth complexes in three dimensions with Delaunay simplices. Piecewise smooth comp...
Tamal K. Dey, Joshua A. Levine
129
Voted
COMPGEOM
2008
ACM
15 years 5 months ago
Visualizing and exploring planar algebraic arrangements: a web application
A web application is presented to compute, plot, and interactively explore planar arrangements induced by algebraic plane curves of arbitrary degree. It produces accurate curve pl...
Pavel Emeliyanenko, Michael Kerber
ICVGIP
2008
15 years 4 months ago
Frequency Domain Visual Servoing Using Planar Contours
Fourier domain methods have had a long association with geometric vision. In this paper, we introduce Fourier domain methods into the field of visual servoing for the first time. ...
Visesh Chari, Avinash Sharma, Anoop M. Namboodiri,...