Sciweavers

6437 search results - page 12 / 1288
» Parallel Algorithms for Arrangements
Sort
View
ICDM
2005
IEEE
168views Data Mining» more  ICDM 2005»
14 years 1 months ago
Discovering Frequent Arrangements of Temporal Intervals
In this paper we study a new problem in temporal pattern mining: discovering frequent arrangements of temporal intervals. We assume that the database consists of sequences of even...
Panagiotis Papapetrou, George Kollios, Stan Sclaro...
ESA
2007
Springer
113views Algorithms» more  ESA 2007»
14 years 1 months ago
Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
We introduce a general framework for processing a set of curves defined on a continuous two-dimensional parametric surface, while sweeping the parameter space. We can handle plan...
Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehl...
SMA
2008
ACM
149views Solid Modeling» more  SMA 2008»
13 years 7 months ago
Exact arrangements on tori and Dupin cyclides
An algorithm and implementation is presented to compute the exact arrangement induced by arbitrary algebraic surfaces on a parametrized ring Dupin cyclide. The family of Dupin cyc...
Eric Berberich, Michael Kerber
IJCGA
1998
74views more  IJCGA 1998»
13 years 7 months ago
Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes
We study the following problem: Given a collection A of polyhedral parts in 3D, determine whether there exists a subset S of the parts that can be moved as a rigid body by in nite...
Leonidas J. Guibas, Dan Halperin, Hirohisa Hirukaw...
COCOON
2010
Springer
14 years 16 days ago
Auspicious Tatami Mat Arrangements
The main purpose of this paper is to introduce the idea of tatami tilings, and to present some of the many interesting and fun questions that arise when studying them. Roughly spea...
Alejandro Erickson, Frank Ruskey, Mark Schurch, Je...