Sciweavers

5210 search results - page 346 / 1042
» Exact geometric computation
Sort
View
COMGEO
1998
ACM
15 years 6 months ago
Variable resolution triangulations
In this paper we introduce variable resolution 4– meshes, a powerful structure for the representation of geometric objects at multiple levels of detail. It combines most propert...
Enrico Puppo
ICCSA
2011
Springer
14 years 10 months ago
On the Parametric Representation of Dynamic Geometry Constructions
This paper describes an ongoing implementation of an open source library dealing with parametric representation of dynamic geometry constructions. We show how some current issues i...
Francisco Botana
COLT
1993
Springer
15 years 11 months ago
Parameterized Learning Complexity
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
Rodney G. Downey, Patricia A. Evans, Michael R. Fe...
EOR
2007
104views more  EOR 2007»
15 years 6 months ago
A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
The two-dimensional orthogonal non-guillotine cutting problem (NGCP) appears in many industries (like wood and steel industries) and consists in cutting a rectangular master surfa...
Roberto Baldacci, Marco A. Boschetti
TAMC
2010
Springer
15 years 5 months ago
Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...
Pinar Heggernes, Daniel Meister, Udi Rotics