Browsing by Author "Iacono, John"
Now showing items 111 of 11

Cacheoblivious dynamic dictionaries with update/query tradeoffs
Brodal, Gerth Stolting; Demaine, Erik D.; Fineman, Jeremy T.; Iacono, John; Langerman, Stefan; e.a. (Society for Industrial and Applied Mathematics, 201001)Several existing cacheoblivious dynamic dictionaries achieve O(logB N) (or slightly better O(logB N over M )) memory transfers per operation, where N is the number of items stored, M is the memory size, and B is ... 
Combining Binary Search Trees
Demaine, Erik D.; Iacono, John; Langerman, Stefan; Ozkan, Ozgur (SpringerVerlag, 201307)We present a general transformation for combining a constant number of binary search tree data structures (BSTs) into a single BST whose running time is within a constant factor of the minimum of any “wellbehaved” bound ... 
Common unfoldings of polyominoes and polycubes
Aloupis, Greg; Bose, Prosenjit; Collette, Sebastien; Demaine, Erik D.; Demaine, Martin L.; e.a. (Springer Berlin / Heidelberg, 201111)This paper studies common unfoldings of various classes of polycubes, as well as a new type of unfolding of polyominoes. Previously, Knuth and Miller found a common unfolding of all treelike tetracubes. By contrast, we ... 
Continuous Blooming of Convex Polyhedra
Demaine, Erik D.; Demaine, Martin L.; Hart, Vi; Iacono, John; Langerman, Stefan; e.a. (SpringerVerlag, 201105)We construct the first two continuous bloomings of all convex polyhedra. First, the source unfolding can be continuously bloomed. Second, any unfolding of a convex polyhedron can be refined (further cut, by a linear number ... 
Coverage with kTransmitters in the Presence of Obstacles
Ballinger, Brad; Benbernou, Nadia M.; Bose, Prosenjit; Damian, Mirela; Demaine, Erik D.; e.a. (Association for Computing Machinery, 201012)For a fixed integer k [greater than or equal to] 0, a ktransmitter is an omnidirectional wireless transmitter with an in nite broadcast range that is able to penetrate up to k "walls", represented as line segments in ... 
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams
Aronov, Boris; Bose, Prosenjit; Gudmundsson, Joachim; Iacono, John; Langerman, Stefan; e.a. (Springer US, 201711)We consider preprocessing a set S of n points in convex position in the plane into a data structure supporting queries of the following form: given a point q and a directed line ℓ in the plane, report the point of S that ... 
Meshes Preserving Minimum Feature Size
Aloupis, Greg; Demaine, Erik D.; Demaine, Martin L.; Dujmovic, Vida; Iacono, John (SpringerVerlag, 2012)The minimum feature size of a planar straightline graph is the minimum distance between a vertex and a nonincident edge. When such a graph is partitioned into a mesh, the degradation is the ratio of original to final ... 
Minimal locked trees
Ballinger, Brad; Charlton, David; Demaine, Erik D.; Demaine, Martin L.; Iacono, John; e.a. (Springer Berlin / Heidelberg, 200907)Locked tree linkages have been known to exist in the plane since 1998, but it is still open whether they have a polynomialtime characterization. This paper examines the properties needed for planar trees to lock, with a ... 
Necklaces, Convolutions, and X+Y
Bremner, David; Chan, Timothy M.; Demaine, Erik D.; Erickson, Jeff; Hurtado, Ferran; e.a. (SpringerVerlag, 201212)We give subquadratic algorithms that, given two necklaces each with n beads at arbitrary positions, compute the optimal rotation of the necklaces to best align the beads. Here alignment is measured according to the ℓ ... 
Necklaces, Convolutions, and X+Y
Bremner, David; Chan, Timothy M.; Demaine, Erik D; Erickson, Jeff; Hurtado, Ferran; e.a. (Springer Nature America, Inc, 201212)We give subquadratic algorithms that, given two necklaces each with n beads at arbitrary positions, compute the optimal rotation of the necklaces to best align the beads. Here alignment is measured according to the lp norm ... 
WorstCase Optimal Tree Layout in External Memory
Demaine, Erik D.; Iacono, John; Langerman, Stefan (SpringerVerlag, 201401)Consider laying out a fixedtopology binary tree of N nodes into external memory with block size B so as to minimize the worstcase number of block memory transfers required to traverse a path from the root to a node of ...