Sciweavers

263 search results - page 50 / 53
» Combinatorial Shape Decomposition
Sort
View
COMPGEOM
2010
ACM
15 years 7 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
122
Voted
FOCS
2002
IEEE
15 years 6 months ago
Low-Dimensional Linear Programming with Violations
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...
Timothy M. Chan
TASE
2008
IEEE
15 years 1 months ago
Group Elevator Scheduling With Advance Information for Normal and Emergency Modes
Group elevator scheduling has long been recognized as an important problem for building transportation efficiency, since unsatisfactory elevator service is one of the major complai...
Peter B. Luh, Bo Xiong, Shi-Chung Chang
CGF
2002
135views more  CGF 2002»
15 years 1 months ago
Slow Growing Subdivision (SGS) in Any Dimension: Towards Removing the Curse of Dimensionality
In recent years subdivision methods have been one of the most successful techniques applied to the multi-resolution representation and visualization of surface meshes. Extension t...
Valerio Pascucci
EVOW
2011
Springer
14 years 5 months ago
Local Search for Mixed-Integer Nonlinear Optimization: A Methodology and an Application
Abstract. A methodology is presented for tackling mixed-integer nonlinear optimization problems by local search, in particular large-scale real-life problems. This methodology is i...
Frédéric Gardi, Karim Nouioua