Sciweavers

1368 search results - page 16 / 274
» Avoiding Simplicity Is Complex
Sort
View
COMPGEOM
2005
ACM
13 years 11 months ago
Inclusion-exclusion formulas from independent complexes
Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We...
Dominique Attali, Herbert Edelsbrunner
CSMR
1998
IEEE
14 years 2 months ago
Assessing Architectural Complexity
While it is widely agreed that architectural simplicity is a key factor to the success of large software systems, it is not obvious how to measure architectural complexity. Our ap...
Rick Kazman, M. Burth
COMPGEOM
2008
ACM
13 years 11 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
LOCWEB
2009
ACM
14 years 2 months ago
Hiding the complexity of LBS
While the demand for Location-based Services (LBS) is strongly increasing, technical laymen are not yet able to build and provide location-aware applications. This paper presents ...
Matthias Böhmer, Gernot Bauer, Wolfgang Wicht
WSCG
2004
166views more  WSCG 2004»
13 years 11 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...