Search results for "Rectangles"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
88	Parinya Chalermsook, Julia Chuzhoy	Maximum independent set of rectangles.	SODA	2009	DBLP DOI BibTeX RDF
81	Takayuki Itoh, Yumi Yamaguchi, Yuko Ikehata, Yasumasa Kajinaga	Hierarchical Data Visualization Using a Fast Rectangle-Packing Algorithm.	IEEE Trans. Vis. Comput. Graph.	2004	DBLP DOI BibTeX RDF	Delaunay triangular mesh, rectangle packing, Hierarchical data
70	Josef Kallrath	Cutting circles and polygons from area-minimizing rectangles.	J. Glob. Optim.	2009	DBLP DOI BibTeX RDF	Non-overlap constraints, Global Optimization, Mixed integer programming, Assignment, Packing problem, Cutting stock problem, Shape constraints, Design problem
70	Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir	Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles.	Discret. Comput. Geom.	2004	DBLP DOI BibTeX RDF
61	Hui Kong 0002, Qiang Ma 0002, Tan Yan, Martin D. F. Wong	An optimal algorithm for finding disjoint rectangles and its application to PCB routing.	DAC	2010	DBLP DOI BibTeX RDF	PCB routing, maximum independent subset, escape routing
61	Fabio Parisini	Bi-dimensional Domains for the Non-overlapping Rectangles Constraint.	ICLP	2008	DBLP DOI BibTeX RDF
61	Noboru Takagi	An Agglomerative Hierarchical Clustering by Finding Adjacent Hyper-Rectangles.	RSCTC	2006	DBLP DOI BibTeX RDF	heap sort, combinatorial optimization problem, agglomerative hierarchical clustering
61	Hiroshi Nagamochi, Yuusuke Abe	An Approximation Algorithm for Dissecting a Rectangle into Rectangles with Specified Areas.	ISAAC	2003	DBLP DOI BibTeX RDF
61	Thomas M. Breuel	An Algorithm for Finding Maximal Whitespace Rectangles at Arbitrary Orientations for Document Layout Analysis.	ICDAR	2003	DBLP DOI BibTeX RDF
61	Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir	Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles.	SCG	2001	DBLP DOI BibTeX RDF
59	Pankaj K. Agarwal, Edward F. Grove, T. M. Murali 0001, Jeffrey Scott Vitter	Binary Search Partitions for Fat Rectangles.	FOCS	1996	DBLP DOI BibTeX RDF	fat rectangles, orthogonal nonintersecting two-dimensional rectangles, proportionality constants, intersecting objects, nonorthogonal objects, algorithm, computational complexity, computation time, binary space partitions, aspect ratio, hidden surface removal
55	Ying Cheng 0006, S. Sitharama Iyengar, Rangasami L. Kashyap	A New Method of Image Compression using Irreducible Covers of Maximum Rectangles.	IEEE Trans. Software Eng.	1988	DBLP DOI BibTeX RDF	irreducible covers, maximal rectangles, concurrent-read-exclusive write, parallel algorithm, parallel algorithms, data structures, data compression, computerised picture processing, image compression, pixels
54	Alberto Belussi, Elisa Bertino, Andrea Nucita	Grid based methods for estimating spatial join selectivity.	GIS	2004	DBLP DOI BibTeX RDF	GIS, query optimization, spatial join
54	Ileana Streinu, Sue Whitesides	Rectangle Visibility Graphs: Characterization, Construction, and Compaction.	STACS	2003	DBLP DOI BibTeX RDF
52	Laurent Tournier, Jean-Luc Gouzé	Qualitative Stability Patterns for Lotka-Volterra Systems on Rectangles.	HSCC	2008	DBLP DOI BibTeX RDF
52	Klaus Jansen, Guochuan Zhang	Maximizing the Total Profit of Rectangles Packed into a Rectangle.	Algorithmica	2007	DBLP DOI BibTeX RDF
52	Toshihide Ibaraki, Kouji Nakamura	Packing Problems with Soft Rectangles.	Hybrid Metaheuristics	2006	DBLP DOI BibTeX RDF
52	Edward G. Coffman Jr., Peter J. Downey, Peter M. Winkler	Packing rectangles in a strip.	Acta Informatica	2002	DBLP DOI BibTeX RDF
52	Jeff Edmonds, Jarek Gryz, Dongming Liang, Renée J. Miller	Mining for Empty Rectangles in Large Data Sets.	ICDT	2001	DBLP DOI BibTeX RDF
52	Ingo Schiermeyer	Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles.	ESA	1994	DBLP DOI BibTeX RDF	level-oriented packing algorithm, two-dimensional packing, k-rectangle packing problem, rectangle packing conjecture, bin-packing
52	Marc J. van Kreveld, Mark de Berg	Finding Squares and Rectangles in Sets of Points.	WG	1989	DBLP DOI BibTeX RDF
48	Tobias Emrich, Hans-Peter Kriegel, Peer Kröger, Matthias Renz, Andreas Züfle	Boosting spatial pruning: on optimal pruning of MBRs.	SIGMOD Conference	2010	DBLP DOI BibTeX RDF	rknn, pruning, spatial, knn, rectangles
48	Marina L. Gavrilova	Two Map Labeling Algorithms for GIS Applications.	ICCSA (1)	2006	DBLP DOI BibTeX RDF	map labeling for polygons with holes, polygonal area removal, sweep algorithm, set of maximum inscribed rectangles, GIS
45	Lars Arge, Mark de Berg, Herman J. Haverkort	Cache-Oblivious R-Trees.	Algorithmica	2009	DBLP DOI BibTeX RDF	Cache-oblivious data structures, R-trees, Geometric data structures, I/O-efficiency
45	Ali Jaoua, Rehab M. Duwairi, Samir Elloumi, Sadok Ben Yahia	Data Mining, Reasoning and Incremental Information Retrieval through Non Enlargeable Rectangular Relation Coverage.	RelMiCS	2009	DBLP DOI BibTeX RDF	Formal Concept Analysis, Galois Connection, Minimal representation
45	John Augustine, Sudarshan Banerjee, Sandy Irani	Strip packing with precedence constraints and strip packing with release times.	SPAA	2006	DBLP DOI BibTeX RDF	scheduling, reconfigurable architectures, precedence constraints, release times, strip packing
45	Mattias Andersson 0002, Joachim Gudmundsson, Christos Levcopoulos	Chips on Wafers.	WADS	2003	DBLP DOI BibTeX RDF
43	Peyman Afshani, Timothy M. Chan	Dynamic Connectivity for Axis-Parallel Rectangles.	Algorithmica	2009	DBLP DOI BibTeX RDF	Dynamic connectivity, Data structures, Computational geometry, Dynamic data structures
43	Genhong Ding, Dan Li, Leng Chen	Solving the packing problem of rectangles with improved genetic algorithm based on statistical analysis.	GEC Summit	2009	DBLP DOI BibTeX RDF	orthogonal packing, packing pattern, surplus rectangle, genetic algorithm, statistical analysis
43	Peyman Afshani, Timothy M. Chan	Dynamic Connectivity for Axis-Parallel Rectangles.	ESA	2006	DBLP DOI BibTeX RDF
43	Jun-Sik Kim 0001, In-So Kweon	Infinite Homography Estimation Using Two Arbitrary Planar Rectangles.	ACCV (2)	2006	DBLP DOI BibTeX RDF
43	Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba	Packing Weighted Rectangles into a Square.	MFCS	2005	DBLP DOI BibTeX RDF
43	Klaus Jansen, Guochuan Zhang	Maximizing the Number of Packed Rectangles.	SWAT	2004	DBLP DOI BibTeX RDF
43	Olivier Beaumont, Vincent Boudet, Fabrice Rastello, Yves Robert	Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms.	Algorithmica	2002	DBLP DOI BibTeX RDF
43	Herbert Süße, Klaus Voss	A new efficient algorithm for fitting of rectangles and squares.	ICIP (2)	2001	DBLP DOI BibTeX RDF
43	Kunihiko Hayashi, Michiko Inoue, Toshimitsu Masuzawa, Hideo Fujiwara	A Layout Adjustment Problem for Disjoint Rectangles Preserving Orthogonal Order.	GD	1998	DBLP DOI BibTeX RDF
43	Zhixiang Chen 0001, Wolfgang Maass 0001	On-line Learning of Rectangles.	COLT	1992	DBLP DOI BibTeX RDF
43	R. Shantaram, John Stewart	An algorithm to minimally decompose a rectilinear figure into rectangles (abstract only).	ACM Conference on Computer Science	1987	DBLP DOI BibTeX RDF
43	Jon Louis Bentley, Thomas Ottmann	The Complexity of Manipulating Hierarchically Defined Sets of Rectangles.	MFCS	1981	DBLP DOI BibTeX RDF
39	Liane Lewin-Eytan, Joseph Naor, Ariel Orda	Admission Control in Networks with Advance Reservations.	Algorithmica	2004	DBLP DOI BibTeX RDF	Line network, Axis parallel rectangles, Approximation algorithms, Independent set, Advance reservations, Local ratio
37	Peter Auer, Philip M. Long, Aravind Srinivasan	Approximating Hyper-Rectangles: Learning and Pseudo-Random Sets.	STOC	1997	DBLP DOI BibTeX RDF	approximations of distributions, machine learning, random graphs, derandomization, pseudorandomness, PAC learning, multiple-instance learning, rectangles, sample complexity, explicit constructions, Ramsey graphs
37	Roy Armoni, Michael E. Saks, Avi Wigderson, Shiyu Zhou	Discrepancy Sets and Pseudorandom Generators for Combinatorial Rectangles.	FOCS	1996	DBLP DOI BibTeX RDF	discrepancy sets, combinatorial rectangles, common subproblem, DNF approximate counting, discrepancy problem, poly(n)-size sample space, random number generation, pseudorandom generators
37	Claire Kenyon, Richard W. Kenyon	Tiling a Polygon with Rectangles	FOCS	1992	DBLP DOI BibTeX RDF	quadratic algorithm, time complexity, geometry, tiling, polygon, linear time algorithm, rectangles
36	Alberto Caprara, Michele Monaci	Bidimensional packing by bilinear programming.	Math. Program.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 52C15
36	David Eppstein, Elena Mumford, Bettina Speckmann, Kevin Verbeek	Area-universal rectangular layouts.	SCG	2009	DBLP DOI BibTeX RDF	rectangular layouts
36	Alberto Caprara, Marco Locatelli 0001, Michele Monaci	Bidimensional Packing by Bilinear Programming.	IPCO	2005	DBLP DOI BibTeX RDF
36	Lars Arge, Mark de Berg, Herman J. Haverkort	Cache-oblivious r-trees.	SCG	2005	DBLP DOI BibTeX RDF	cache-oblivious data structures, R-trees, geometric data structures, I/O-efficiency
36	José R. Correa, Claire Kenyon	Approximation schemes for multidimensional packing.	SODA	2004	DBLP BibTeX RDF
36	Klaus Jansen, Guochuan Zhang	On rectangle packing: maximizing benefits.	SODA	2004	DBLP BibTeX RDF
36	Alberto Caprara, Andrea Lodi 0001, Michele Monaci	An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem.	IPCO	2002	DBLP DOI BibTeX RDF
36	Norio Katayama, Shin'ichi Satoh 0001	The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries.	SIGMOD Conference	1997	DBLP DOI BibTeX RDF
34	Ke Chen 0006, Haim Kaplan, Micha Sharir	Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles.	ACM Trans. Algorithms	2009	DBLP DOI BibTeX RDF	Conflict free coloring, online algorithms, coloring
34	Mathias Ortner, Xavier Descombes, Josiane Zerubia	A Marked Point Process of Rectangles and Segments for Automatic Analysis of Digital Elevation Models.	IEEE Trans. Pattern Anal. Mach. Intell.	2008	DBLP DOI BibTeX RDF	dense urban area, land register, RJMCMC, Image processing, simulated annealing, MCMC, stochastic geometry, Poisson point process, Digital Elevation Models, building detection
34	Hee-Kap Ahn, Sang Won Bae	Covering a Point Set by Two Disjoint Rectangles.	ISAAC	2008	DBLP DOI BibTeX RDF
34	Rolf Harren, Rob van Stee	Packing Rectangles into 2OPT Bins Using Rotations.	SWAT	2008	DBLP DOI BibTeX RDF	absolute worst-case ratio, approximation algorithm, bin packing, rectangle packing
34	Yakov Nekrich	I/O-Efficient Point Location in a Set of Rectangles.	LATIN	2008	DBLP DOI BibTeX RDF
34	Chandan Saha 0001, Sandip Das 0001	Covering a Set of Points in a Plane Using Two Parallel Rectangles.	ICCTA	2007	DBLP DOI BibTeX RDF
34	Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth	Cuttings for Disks and Axis-Aligned Rectangles.	WADS	2007	DBLP DOI BibTeX RDF
34	Alp Atici, Rocco A. Servedio	Learning Unions of omega(1)-Dimensional Rectangles.	ALT	2006	DBLP DOI BibTeX RDF
34	Jun-Sik Kim 0001, In-So Kweon	Estimating Intrinsic Parameters of Cameras using Two Arbitrary Rectangles.	ICPR (1)	2006	DBLP DOI BibTeX RDF
34	I-Lun Tseng, Adam Postula	An efficient algorithm for partitioning parameterized polygons into rectangles.	ACM Great Lakes Symposium on VLSI	2006	DBLP DOI BibTeX RDF	corner stitching, parameterized layouts, parameterized polygons, polygon decomposition
34	Eric Rémila	Tiling a Polygon with Two Kinds of Rectangles.	Discret. Comput. Geom.	2005	DBLP DOI BibTeX RDF
34	Eric Rémila	Tiling a Polygon with Two Kinds of Rectangles.	ESA	2004	DBLP DOI BibTeX RDF
34	Jarkko Kari, Cristopher Moore	Rectangles and Squares Recognized by Two-Dimensional Automata.	Theory Is Forever	2004	DBLP DOI BibTeX RDF
34	Luigi Cinque, Fabio De Rosa, Fabio Lecca, Stefano Levialdi, Steven L. Tanimoto	Image Retrieval Using Resegmentation Driven by Query Rectangles.	ICPR (4)	2002	DBLP DOI BibTeX RDF
34	San-Yuan Wu, Sartaj Sahni	Covering rectilinear polygons by rectangles.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1990	DBLP DOI BibTeX RDF
34	Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger	The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles.	SIGMOD Conference	1990	DBLP DOI BibTeX RDF
34	Jiahuang Ji, Menkae Jeng	Bin-packing adjustable rectangles and applications to task scheduling on partitionable parallel computers.	SPDP	1990	DBLP DOI BibTeX RDF
34	Otfried Schwarzkopf, Ulrich Fuchs 0001, Günter Rote, Emo Welzl	Approximation of Convex Figures by Pairs of Rectangles.	STACS	1990	DBLP DOI BibTeX RDF
34	Subhas C. Nandy, Bhargab B. Bhattacharya, Sibabrata Ray	Efficient algorithms for Identifying All Maximal Isothetic Empty Rectangles in VLSI Layout Design.	FSTTCS	1990	DBLP DOI BibTeX RDF	interval trees, complexity, Computational geometry, placement, VLSI layout, geometric algorithms
34	Marshall W. Bern	Hidden Surface Removal for Rectangles.	SCG	1988	DBLP DOI BibTeX RDF
34	Sching L. Lin, Jonathan Allen	Minplex - a compactor that minimizes the bounding rectangle and individual rectangles in a layout.	DAC	1986	DBLP DOI BibTeX RDF
34	Christos Levcopoulos, Andrzej Lingas	Covering Polygons with Minimum Number of Rectangles.	STACS	1984	DBLP DOI BibTeX RDF
32	Gerold Jäger, Klas Markström, Denys Shcherbak, Lars-Daniel Öhman	Small Youden Rectangles, Near Youden Rectangles, and Their Connections to Other Row-Column Designs.	Discret. Math. Theor. Comput. Sci.	2023	DBLP DOI BibTeX RDF
32	Marco Caoduro	Geometric challenges in combinatorial optimization : packing, hitting, and coloring rectangles. (Problèmes de géométrie en optimisation combinatoire : packing, transversaux, et coloration de rectangles).		2022	RDF
32	Anna Adamaszek, Parinya Chalermsook, Andreas Wiese	How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking.	APPROX-RANDOM	2015	DBLP DOI BibTeX RDF
32	Radim Belohlávek, Vilém Vychodil	Replacing full rectangles by dense rectangles: Concept lattices and attribute implications.	IRI	2006	DBLP DOI BibTeX RDF
32	Zhixiang Chen 0001, Wolfgang Maass 0001	On-Line Learning of Rectangles and Unions of Rectangles.	Mach. Learn.	1994	DBLP DOI BibTeX RDF
32	Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Thomas Ohler, Gerald Thiemt, Peter Widmayer	An Optimal Algorithm for Approximating a Set of Rectangles by Two Minimum Area Rectangles.	Workshop on Computational Geometry	1991	DBLP DOI BibTeX RDF
30	Ratko Orlandic, Byunggu Yu	A Study of MBR-Based Spatial Access Methods: How Well They Perform in High-Dimensional Spaces.	IDEAS	2000	DBLP DOI BibTeX RDF	MBR based spatial access methods, spatial applications, extended objects, minimum bounding rectangles, MBRs, conceptual problems, MBR based SAMs, MBR based structure, QSF-trees, high dimensional data, spatial data, spatial data structures, high dimensionality, high dimensional spaces
30	Claudia I. Horta, José A. Lima	Slicing and non-slicing, unified and rotation independent, algebraic representation of floorplans.	EUROMICRO	1997	DBLP DOI BibTeX RDF	floorplan area optimization problem, rectangle envelope, nonoverlapping basic rectangles, floorplan topology, formal algebraic specification, SETS notation, VLSI physical design layout, module dimensions, arbitrarily complex composite floorplans, rotation-invariant single-expression formalism, generalized wheels floorplans, slicing representation, nonslicing representation, unified representation, topology-dimensionless description, floorplanning problem algorithms, algebraic specification, line segments, relative positioning
30	J. T. Mowchenko, Y. Yang	Optimizing wiring space in slicing floorplans.	Great Lakes Symposium on VLSI	1995	DBLP DOI BibTeX RDF	wiring space optimisation, slicing floorplans, net density, sibling rectangles, circuit modules, routed layouts, VLSI, heuristic, network routing, circuit layout CAD, circuit optimisation, integrated circuit layout, branch and bound algorithm, wiring, IC layout
27	Mingxi Wu, Xiuyao Song, Chris Jermaine, Sanjay Ranka, John Gums	A LRT framework for fast spatial anomaly detection.	KDD	2009	DBLP DOI BibTeX RDF	LRT spatial anomaly
27	Hsiu-ching Hsieh, Chih-Chieh Hsiao, Hui-Chin Yang, Chung-Ping Chung, Jean Jyh-Jiun Shann	Methods for Precise False-Overlap Detection in Tile-Based Rendering.	CSE (2)	2009	DBLP DOI BibTeX RDF
27	Deshi Ye, Xin Han, Guochuan Zhang	On-Line Multiple-Strip Packing.	COCOA	2009	DBLP DOI BibTeX RDF	many-core scheduling, approximation algorithms, Strip packing
27	Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang 0001	Variable-Size Rectangle Covering.	COCOA	2009	DBLP DOI BibTeX RDF
27	Toshihiko Takahashi, Ryo Fujimaki, Youhei Inoue	A (4n - 4)-Bit Representation of a Rectangular Drawing or Floorplan.	COCOON	2009	DBLP DOI BibTeX RDF
27	Igor Timko, Michael H. Böhlen, Johann Gamper	Sequenced spatio-temporal aggregation in road networks.	EDBT	2009	DBLP DOI BibTeX RDF
27	Guy Even, Retsef Levi, Dror Rawitz, Baruch Schieber, Shimon Shahar, Maxim Sviridenko	Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	capacitated covering, rectangle stabbing, Approximation algorithms, lot sizing
27	Branislav Micusík, Horst Wildenauer, Jana Kosecka	Detection and matching of rectilinear structures.	CVPR	2008	DBLP DOI BibTeX RDF
27	Alexey L. Lastovetsky	On Grid-based Matrix Partitioning for Heterogeneous Processors.	ISPDC	2007	DBLP DOI BibTeX RDF
27	Chandan Giri, Soumojit Sarkar, Santanu Chattopadhyay	A genetic algorithm based heuristic technique for power constrained test scheduling in core-based SOCs.	VLSI-SoC	2007	DBLP DOI BibTeX RDF
27	Klaus Jansen, Roberto Solis-Oba	New Approximability Results for 2-Dimensional Packing Problems.	MFCS	2007	DBLP DOI BibTeX RDF
27	Adam L. Buchsbaum, Emden R. Gansner, Suresh Venkatasubramanian	Directed graphs and rectangular layouts.	APVIS	2007	DBLP DOI BibTeX RDF
27	Chandan Giri, Soumojit Sarkar, Santanu Chattopadhyay	Test Scheduling for Core-Based SOCs Using Genetic Algorithm Based Heuristic Approach.	ICIC (2)	2007	DBLP DOI BibTeX RDF	wrapper design, test scheduling, test access mechanism, SOC testing
27	Stefan Porschen	Optimal Parameterized Rectangular Coverings.	ICCSA (1)	2007	DBLP DOI BibTeX RDF	parameterized rectangular covering, integer grid, dynamic programming, NP-hardness, optimization problem, exact algorithmics, closure operator
27	Guy Even, Dror Rawitz, Shimon Shahar	Approximation Algorithms for Capacitated Rectangle Stabbing.	CIAC	2006	DBLP DOI BibTeX RDF
27	Aleksei V. Fishkin, Olga Gerber, Klaus Jansen	On Efficient Weighted Rectangle Packing with Large Resources.	ISAAC	2005	DBLP DOI BibTeX RDF	approximation, resources, rectangle packing
27	Martha J. Kosa, Mark A. Boshart	Treemap visualizations for CS2.	ITiCSE	2004	DBLP DOI BibTeX RDF
27	Stefan Porschen	On the Time Complexity of Rectangular Covering Problems in the Discrete Plane.	ICCSA (3)	2004	DBLP DOI BibTeX RDF	rectangular set cover, integer lattice, NP-completeness, discrete plane