Sciweavers

2272 search results - page 116 / 455
» Capture Complexity by Partition
Sort
View
IPL
2002
118views more  IPL 2002»
14 years 9 months ago
Lower bounds for approximate polygon decomposition and minimum gap
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
Joachim Gudmundsson, Thore Husfeldt, Christos Levc...
SMA
2009
ACM
157views Solid Modeling» more  SMA 2009»
15 years 4 months ago
Constraint-based model synthesis
We present a method for procedurally modeling general complex 3D shapes. Our approach is targeted towards applications in digital entertainment and gaming and can automatically ge...
Paul Merrell, Dinesh Manocha
CSR
2007
Springer
15 years 4 months ago
Equivalence Problems for Circuits over Sets of Natural Numbers
We investigate the complexity of equivalence problems for {∪, ∩, − , +, ×}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer an...
Christian Glaßer, Katrin Herr, Christian Rei...
IPSN
2005
Springer
15 years 3 months ago
Coverage and hole-detection in sensor networks via homology
We consider coverage problems in sensor networks of stationary nodes with minimal geometric data. In particular, there are no coordinates and no localization of nodes. We introduc...
Robert Ghrist, Abubakr Muhammad
MOBIS
2008
14 years 11 months ago
Towards Simulation-supported Enterprise Architecture Management
Abstract: Enterprise architecture management is based on a holistic view on the enterprise addressing business and IT aspects in an integrated manner. EA management is a process to...
Sabine Buckl, Florian Matthes, Wolfgang Renz, Chri...