Sciweavers

166 search results - page 11 / 34
» Complexity of Some Geometric and Topological Problems
Sort
View
WSCG
2004
166views more  WSCG 2004»
13 years 10 months ago
Non-evaluated Manipulation of Complex CSG Solids
One of the most important problems to solve in Solid Modeling is computing boolean operations for solids (union, intersection and difference). In this paper we present a method to...
Rafael Jesús Segura, Francisco R. Feito, Ju...
DCG
2011
13 years 3 days ago
A Celtic Framework for Knots and Links
We describe a variant of a method used by modern graphic artists to design what are traditionally called Celtic knots, which are part of a larger family of designs called “mirro...
Jonathan L. Gross, Thomas W. Tucker
COCOON
2008
Springer
13 years 10 months ago
Multi-party Quantum Communication Complexity with Routed Messages
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashit...
IEAAIE
1998
Springer
14 years 24 days ago
Complexity and Cognitive Computing
Abstract. This paper has as main goal to develop a hybrid expert system to minimize some of the complexity problems related to arti cial intelligence eld. For instance, we can ment...
Lourdes Mattos Brasil, Fernando Mendes de Azevedo,...
ECCV
2002
Springer
14 years 10 months ago
Tracking and Rendering Using Dynamic Textures on Geometric Structure from Motion
Estimating geometric structure from uncalibrated images accurately enough for high quality rendering is difficult. We present a method where only coarse geometric structure is trac...
Dana Cobzas, Martin Jägersand