Sciweavers

102291 search results - page 185 / 20459
» Computability in Computational Geometry
Sort
View
GRAPHITE
2004
ACM
15 years 11 months ago
Smooth constraints for spline variational modeling
This article introduces a new class of constraints for spline variational modeling, which allows more flexible user specification, as a constrained point can ”slide” along a...
Julien Lenoir, Laurent Grisoni, Philippe Meseure, ...
STOC
2004
ACM
177views Algorithms» more  STOC 2004»
16 years 6 months ago
Lower bounds for linear degeneracy testing
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
Nir Ailon, Bernard Chazelle
137
Voted
VRML
2000
ACM
15 years 10 months ago
The morph node
We discuss potential and limitations of a Morph Node, inspired by the corresponding construct in Java3D. A Morph Node in Java3D interpolates vertex attributes among several homeom...
Marc Alexa, Johannes Behr, Wolfgang Müller 00...
125
Voted
RT
2005
Springer
15 years 11 months ago
Fast Exact From-Region Visibility in Urban Scenes
We present a fast exact from-region visibility algorithm for 2.5D urban scenes. The algorithm uses a subdivision of line space for identifying visibility interactions in a 2D foot...
Jirí Bittner, Peter Wonka, Michael Wimmer
CVPR
1996
IEEE
16 years 8 months ago
Combining greyvalue invariants with local constraints for object recognition
This paper addresses the problem of recognizing objects in large image databases. The method is based on local characteristics which are invariant to simzlarity transformations in...
Cordelia Schmid, Roger Mohr
« Prev « First page 185 / 20459 Last » Next »