2008 |
41 | EE | Yago Diez,
Mario A. Lopez,
Joan Antoni Sellarès:
Noisy Road Network Matching.
GIScience 2008: 38-54 |
40 | EE | Mario A. Lopez,
Yan Mayster:
Weighted Rectilinear Approximation of Points in the Plane.
LATIN 2008: 642-653 |
39 | EE | Mario A. Lopez,
Shlomo Reisner:
Hausdorff approximation of 3D convex polytopes.
Inf. Process. Lett. 107(2): 76-82 (2008) |
2007 |
38 | EE | Mario A. Lopez,
Shlomo Reisner:
A note on equipartition
CoRR abs/0707.4298: (2007) |
2006 |
37 | EE | Kyoung-Sook Kim,
Mario A. Lopez,
Scott T. Leutenegger,
Ki-Joune Li:
A Network-Based Indexing Method for Trajectories of Moving Objects.
ADVIS 2006: 344-353 |
36 | EE | Yan Mayster,
Mario A. Lopez:
Rectilinear Approximation of a Set of Points in the Plane.
LATIN 2006: 715-726 |
35 | EE | José Miguel Díaz-Báñez,
Mario Alberto López,
Joan Antoni Sellarès:
Locating an obnoxious plane.
European Journal of Operational Research 173(2): 556-564 (2006) |
34 | EE | Lawrence Argent,
Bill Depper,
Rafael Fajardo,
Sarah Gjertson,
Scott T. Leutenegger,
Mario A. Lopez,
Jeff Rutenbeck:
Building a Game Development Program.
IEEE Computer 39(6): 52-60 (2006) |
33 | EE | José Miguel Díaz-Báñez,
Mario Alberto López,
Joan Antoni Sellarès:
On finding a widest empty 1-corner corridor.
Inf. Process. Lett. 98(5): 199-205 (2006) |
32 | EE | Yan Mayster,
Mario A. Lopez:
Approximating a set of points by a step function.
J. Visual Communication and Image Representation 17(6): 1178-1189 (2006) |
2005 |
31 | EE | Mario A. Lopez,
Shlomo Reisner:
Hausdorff approximation of convex polygons.
Comput. Geom. 32(2): 139-158 (2005) |
30 | EE | José Miguel Díaz-Báñez,
Ferran Hurtado,
Mario Alberto López,
Joan Antoni Sellarès:
Optimal projections onto grids and finite resolution images.
J. Visual Communication and Image Representation 16(3): 233-249 (2005) |
2004 |
29 | EE | Hak-Cheol Kim,
Mario A. Lopez,
Scott T. Leutenegger,
Ki-Joune Li:
Efficient Declustering of Non-uniform Multidimensional Data Using Shifted Hilbert Curves.
DASFAA 2004: 694-707 |
28 | EE | José Miguel Díaz-Báñez,
Mario Alberto López,
Joan Antoni Sellarès:
Computing Largest Empty Slabs.
ICCSA (3) 2004: 99-108 |
27 | EE | Sahar Idwan,
Dinesh P. Mehta,
Mario A. Lopez:
Fast Pursuit Of Mobile Nodes Using TPR Trees.
Int. J. Found. Comput. Sci. 15(5): 753-772 (2004) |
2003 |
26 | EE | José Miguel Díaz-Báñez,
Ferran Hurtado,
Mario Alberto López,
Joan Antoni Sellarès:
Optimal Point Set Projections onto Regular Grids.
ISAAC 2003: 270-279 |
2002 |
25 | EE | Mario A. Lopez,
Bradford G. Nickerson:
Analysis of half-space range search using the k-d search skip list.
CCCG 2002: 58-62 |
24 | | Mario A. Lopez,
Shlomo Reisner:
Linear time approximation of 3D convex polytopes.
Comput. Geom. 23(3): 291-301 (2002) |
2001 |
23 | EE | Swanwa Liao,
Mario A. Lopez,
Scott T. Leutenegger:
High Dimensional Similarity Search With Space Filling Curves.
ICDE 2001: 615-622 |
22 | EE | Swanwa Liao,
Mario A. Lopez,
Dinesh P. Mehta:
Constrained polygon transformations for incremental floorplanning.
ACM Trans. Design Autom. Electr. Syst. 6(3): 322-342 (2001) |
2000 |
21 | EE | Scott T. Leutenegger,
Rostislav M. Sheykhet,
Mario A. Lopez:
A mechanism to detect changing access patterns and automatically migrate distributed R-tree indexed multidimensional data.
ACM-GIS 2000: 147-152 |
20 | EE | Mario A. Lopez,
Swanwa Liao:
Finding k-Closest-Pairs Efficiently for High Dimensional Data.
CCCG 2000 |
19 | EE | Simonas Saltenis,
Christian S. Jensen,
Scott T. Leutenegger,
Mario A. Lopez:
Indexing the Positions of Continuously Moving Objects.
SIGMOD Conference 2000: 331-342 |
18 | EE | Scott T. Leutenegger,
Mario A. Lopez:
The Effect of Buffering on the Performance of R-Trees.
IEEE Trans. Knowl. Data Eng. 12(1): 33-44 (2000) |
17 | | Mario A. Lopez,
Shlomo Reisner:
Efficient Approximation of Convex Polygons.
Int. J. Comput. Geometry Appl. 10(5): 445-452 (2000) |
1999 |
16 | EE | Yván J. García,
Mario A. Lopez,
Scott T. Leutenegger:
Post-Optimization and Incremental Refinement of R-Trees.
ACM-GIS 1999: 91-96 |
15 | | Mario A. Lopez,
Shlomo Reisner:
Algorithms for Polyhedral Approximation of Multidimensional Ellipsoids.
J. Algorithms 33(1): 140-165 (1999) |
1998 |
14 | EE | Yván J. García,
Mario A. Lopez,
Scott T. Leutenegger:
A Greedy Algorithm for Bulk Loading R-Trees.
ACM-GIS 1998: 163-164 |
13 | EE | Scott T. Leutenegger,
Mario A. Lopez:
The Effect of Buffering on the Performance of R-Trees.
ICDE 1998: 164-171 |
12 | EE | Yván J. García,
Mario A. Lopez,
Scott T. Leutenegger:
On Optimal Node Splitting for R-trees.
VLDB 1998: 334-344 |
11 | EE | Mario A. Lopez,
Shlomo Reisner:
A Special Case of Mahler's Conjecture.
Discrete & Computational Geometry 20(2): 163-177 (1998) |
1997 |
10 | EE | Scott T. Leutenegger,
J. M. Edgington,
Mario A. Lopez:
STR: A Simple and Efficient Algorithm for R-Tree Packing.
ICDE 1997: 497-506 |
1996 |
9 | EE | Mario A. Lopez,
Dinesh P. Mehta:
Partitioning Algorithms for Corner Stitching.
Great Lakes Symposium on VLSI 1996: 200- |
8 | | Scott T. Leutenegger,
Mario A. Lopez:
A Buffer Model for Evaluating the Performance of R-Tree Packing Algorithms.
SIGMETRICS 1996: 264-265 |
7 | EE | Mario A. Lopez,
Dinesh P. Mehta:
Efficient decomposition of polygons into L-shapes with application to VLSI layouts.
ACM Trans. Design Autom. Electr. Syst. 1(3): 371-395 (1996) |
6 | EE | Mario A. Lopez,
Ravi Janardan,
Sartaj K. Sahni:
Efficient net extraction for restricted orientation designs [VLSI layout].
IEEE Trans. on CAD of Integrated Circuits and Systems 15(9): 1151-1159 (1996) |
1995 |
5 | | Mario Alberto López,
Ramakrishna Thurimella:
On Computing Connected Components of Line Segments.
IEEE Trans. Computers 44(4): 597-601 (1995) |
1994 |
4 | | Peter Thomas Breznay,
Mario Alberto López:
A Class of Static and Dynamic Hierarchical Interconnection Networks.
ICPP (1) 1994: 59-62 |
1993 |
3 | EE | Mario A. Lopez,
Ravi Janardan,
Sartaj K. Sahni:
A fast algorithm for VLSI net extraction.
ICCAD 1993: 770-774 |
2 | | Peter Thomas Breznay,
Mario Alberto López:
Tightly Connected Hierarchical Interconnection Networks for Parallel Processors.
ICPP 1993: 307-310 |
1 | | Ravi Janardan,
Mario A. Lopez:
Generalized intersection searching problems.
Int. J. Comput. Geometry Appl. 3(1): 39-69 (1993) |