Search

Your search keyword '"Korman, Matias"' showing total 16 results
Start Over Author "Korman, Matias" Publisher elsevier
16 results on '"Korman, Matias"'

1. On the Complexity of Barrier Resilience for Fat Regions and Bounded Ply

Author

Sub Multimedia & Geometry begr. 1/1/13, Geometric Computing, Sub Geometric Computing, Korman, Matias, Löffler, Maarten, Silveira, Rodrigo I., Strash, Darren, Sub Multimedia & Geometry begr. 1/1/13, Geometric Computing, Sub Geometric Computing, Korman, Matias, Löffler, Maarten, Silveira, Rodrigo I., and Strash, Darren

Published
2018

2. Colored spanning graphs for set visualization

Author

Sub Multimedia & Geometry begr. 1/1/13, Computational Geometry, Sub Geometric Computing, Hurtado, Ferran, Korman, Matias, van Kreveld, M.J., Löffler, Maarten, Sacristán, Vera, Shioura, Akiyoshi, Silveira, Rodrigo I., Speckmann, Bettina, Tokuyama, Takeshi, Sub Multimedia & Geometry begr. 1/1/13, Computational Geometry, Sub Geometric Computing, Hurtado, Ferran, Korman, Matias, van Kreveld, M.J., Löffler, Maarten, Sacristán, Vera, Shioura, Akiyoshi, Silveira, Rodrigo I., Speckmann, Bettina, and Tokuyama, Takeshi

Published
2018

3. On the Complexity of Barrier Resilience for Fat Regions and Bounded Ply

Author

Sub Multimedia & Geometry begr. 1/1/13, Geometric Computing, Sub Geometric Computing, Korman, Matias, Löffler, Maarten, Silveira, Rodrigo I., Strash, Darren, Sub Multimedia & Geometry begr. 1/1/13, Geometric Computing, Sub Geometric Computing, Korman, Matias, Löffler, Maarten, Silveira, Rodrigo I., and Strash, Darren

Published
2018

4. Colored spanning graphs for set visualization

Author

Sub Multimedia & Geometry begr. 1/1/13, Computational Geometry, Sub Geometric Computing, Hurtado, Ferran, Korman, Matias, van Kreveld, M.J., Löffler, Maarten, Sacristán, Vera, Shioura, Akiyoshi, Silveira, Rodrigo I., Speckmann, Bettina, Tokuyama, Takeshi, Sub Multimedia & Geometry begr. 1/1/13, Computational Geometry, Sub Geometric Computing, Hurtado, Ferran, Korman, Matias, van Kreveld, M.J., Löffler, Maarten, Sacristán, Vera, Shioura, Akiyoshi, Silveira, Rodrigo I., Speckmann, Bettina, and Tokuyama, Takeshi

Published
2018

5. On the Complexity of Barrier Resilience for Fat Regions and Bounded Ply

Author

Sub Multimedia & Geometry begr. 1/1/13, Geometric Computing, Sub Geometric Computing, Korman, Matias, Löffler, Maarten, Silveira, Rodrigo I., Strash, Darren, Sub Multimedia & Geometry begr. 1/1/13, Geometric Computing, Sub Geometric Computing, Korman, Matias, Löffler, Maarten, Silveira, Rodrigo I., and Strash, Darren

Published
2018

6. Colored spanning graphs for set visualization

Author

Sub Multimedia & Geometry begr. 1/1/13, Computational Geometry, Sub Geometric Computing, Hurtado, Ferran, Korman, Matias, van Kreveld, M.J., Löffler, Maarten, Sacristán, Vera, Shioura, Akiyoshi, Silveira, Rodrigo I., Speckmann, Bettina, Tokuyama, Takeshi, Sub Multimedia & Geometry begr. 1/1/13, Computational Geometry, Sub Geometric Computing, Hurtado, Ferran, Korman, Matias, van Kreveld, M.J., Löffler, Maarten, Sacristán, Vera, Shioura, Akiyoshi, Silveira, Rodrigo I., Speckmann, Bettina, and Tokuyama, Takeshi

Published
2018

7. Stabbing segments with rectilinear objects

Author

Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII), Universidad de Sevilla. FQM164: Matemática Discreta: Teoría de Grafos y Geometría Computacional, Claverol Aguas, Mercé, Garijo Royo, Delia, Korman, Matias, Seara Ojea, Carlos, Silveira Isoba, Rodrigo Ignacio, Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII), Universidad de Sevilla. FQM164: Matemática Discreta: Teoría de Grafos y Geometría Computacional, Claverol Aguas, Mercé, Garijo Royo, Delia, Korman, Matias, Seara Ojea, Carlos, and Silveira Isoba, Rodrigo Ignacio

Abstract

Given a set S of n line segments in the plane, we say that a region R R2 is a stabber for S if R contains exactly one endpoint of each segment of S. In this paper we provide optimal or near-optimal algorithms for reporting all combinatorially di erent stabbers for several shapes of stabbers. Speci cally, we consider the case in which the stabber can be described as the intersection of axis-parallel halfplanes (thus the stabbers are halfplanes, strips, quadrants, 3-sided rectangles, or rectangles). The running times are O(n) (for the halfplane case), O(n log n) (for strips, quadrants, and 3-sided rectangles), and O(n2 log n) (for rectangles).

Published
2017

8. Stabbing segments with rectilinear objects

Author

Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII), Universidad de Sevilla. FQM164: Matemática Discreta: Teoría de Grafos y Geometría Computacional, Claverol Aguas, Mercé, Garijo Royo, Delia, Korman, Matias, Seara Ojea, Carlos, Silveira Isoba, Rodrigo Ignacio, Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII), Universidad de Sevilla. FQM164: Matemática Discreta: Teoría de Grafos y Geometría Computacional, Claverol Aguas, Mercé, Garijo Royo, Delia, Korman, Matias, Seara Ojea, Carlos, and Silveira Isoba, Rodrigo Ignacio

Abstract

Given a set S of n line segments in the plane, we say that a region R R2 is a stabber for S if R contains exactly one endpoint of each segment of S. In this paper we provide optimal or near-optimal algorithms for reporting all combinatorially di erent stabbers for several shapes of stabbers. Speci cally, we consider the case in which the stabber can be described as the intersection of axis-parallel halfplanes (thus the stabbers are halfplanes, strips, quadrants, 3-sided rectangles, or rectangles). The running times are O(n) (for the halfplane case), O(n log n) (for strips, quadrants, and 3-sided rectangles), and O(n2 log n) (for rectangles).

Published
2017

9. Packing plane spanning trees and paths in complete geometric graphs

Author

Sub Computational Geometry, Computational Geometry, Aichholzer, Oswin, Hackl, Thomas, Korman, Matias, van Kreveld, M.J., Löffler, Maarten, Pilz, Alexander, Speckmann, Bettina, Welzl, Emo, Sub Computational Geometry, Computational Geometry, Aichholzer, Oswin, Hackl, Thomas, Korman, Matias, van Kreveld, M.J., Löffler, Maarten, Pilz, Alexander, Speckmann, Bettina, and Welzl, Emo

Published
2017

10. Stabbing segments with rectilinear objects

Author

Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII), Universidad de Sevilla. FQM164: Matemática Discreta: Teoría de Grafos y Geometría Computacional, Claverol Aguas, Mercé, Garijo Royo, Delia, Korman, Matias, Seara Ojea, Carlos, Silveira Isoba, Rodrigo Ignacio, Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII), Universidad de Sevilla. FQM164: Matemática Discreta: Teoría de Grafos y Geometría Computacional, Claverol Aguas, Mercé, Garijo Royo, Delia, Korman, Matias, Seara Ojea, Carlos, and Silveira Isoba, Rodrigo Ignacio

Abstract

Given a set S of n line segments in the plane, we say that a region R R2 is a stabber for S if R contains exactly one endpoint of each segment of S. In this paper we provide optimal or near-optimal algorithms for reporting all combinatorially di erent stabbers for several shapes of stabbers. Speci cally, we consider the case in which the stabber can be described as the intersection of axis-parallel halfplanes (thus the stabbers are halfplanes, strips, quadrants, 3-sided rectangles, or rectangles). The running times are O(n) (for the halfplane case), O(n log n) (for strips, quadrants, and 3-sided rectangles), and O(n2 log n) (for rectangles).

Published
2017

11. Packing plane spanning trees and paths in complete geometric graphs

Author

Sub Computational Geometry, Computational Geometry, Aichholzer, Oswin, Hackl, Thomas, Korman, Matias, van Kreveld, M.J., Löffler, Maarten, Pilz, Alexander, Speckmann, Bettina, Welzl, Emo, Sub Computational Geometry, Computational Geometry, Aichholzer, Oswin, Hackl, Thomas, Korman, Matias, van Kreveld, M.J., Löffler, Maarten, Pilz, Alexander, Speckmann, Bettina, and Welzl, Emo

Published
2017

12. Stabbing segments with rectilinear objects

Author

Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII), Universidad de Sevilla. FQM164: Matemática Discreta: Teoría de Grafos y Geometría Computacional, Claverol Aguas, Mercé, Garijo Royo, Delia, Korman, Matias, Seara Ojea, Carlos, Silveira Isoba, Rodrigo Ignacio, Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII), Universidad de Sevilla. FQM164: Matemática Discreta: Teoría de Grafos y Geometría Computacional, Claverol Aguas, Mercé, Garijo Royo, Delia, Korman, Matias, Seara Ojea, Carlos, and Silveira Isoba, Rodrigo Ignacio

Abstract

Given a set S of n line segments in the plane, we say that a region R R2 is a stabber for S if R contains exactly one endpoint of each segment of S. In this paper we provide optimal or near-optimal algorithms for reporting all combinatorially di erent stabbers for several shapes of stabbers. Speci cally, we consider the case in which the stabber can be described as the intersection of axis-parallel halfplanes (thus the stabbers are halfplanes, strips, quadrants, 3-sided rectangles, or rectangles). The running times are O(n) (for the halfplane case), O(n log n) (for strips, quadrants, and 3-sided rectangles), and O(n2 log n) (for rectangles).

Published
2017

13. Stabbing segments with rectilinear objects

Author

Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII), Universidad de Sevilla. FQM164: Matemática Discreta: Teoría de Grafos y Geometría Computacional, Claverol Aguas, Mercé, Garijo Royo, Delia, Korman, Matias, Seara Ojea, Carlos, Silveira Isoba, Rodrigo Ignacio, Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII), Universidad de Sevilla. FQM164: Matemática Discreta: Teoría de Grafos y Geometría Computacional, Claverol Aguas, Mercé, Garijo Royo, Delia, Korman, Matias, Seara Ojea, Carlos, and Silveira Isoba, Rodrigo Ignacio

Abstract

Given a set S of n line segments in the plane, we say that a region R R2 is a stabber for S if R contains exactly one endpoint of each segment of S. In this paper we provide optimal or near-optimal algorithms for reporting all combinatorially di erent stabbers for several shapes of stabbers. Speci cally, we consider the case in which the stabber can be described as the intersection of axis-parallel halfplanes (thus the stabbers are halfplanes, strips, quadrants, 3-sided rectangles, or rectangles). The running times are O(n) (for the halfplane case), O(n log n) (for strips, quadrants, and 3-sided rectangles), and O(n2 log n) (for rectangles).

Published
2017

14. Packing plane spanning trees and paths in complete geometric graphs

Author

Sub Computational Geometry, Computational Geometry, Aichholzer, Oswin, Hackl, Thomas, Korman, Matias, van Kreveld, M.J., Löffler, Maarten, Pilz, Alexander, Speckmann, Bettina, Welzl, Emo, Sub Computational Geometry, Computational Geometry, Aichholzer, Oswin, Hackl, Thomas, Korman, Matias, van Kreveld, M.J., Löffler, Maarten, Pilz, Alexander, Speckmann, Bettina, and Welzl, Emo

Published
2017

15. Stabbing segments with rectilinear objects

Author

Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII), Universidad de Sevilla. FQM164: Matemática Discreta: Teoría de Grafos y Geometría Computacional, Claverol Aguas, Mercé, Garijo Royo, Delia, Korman, Matias, Seara Ojea, Carlos, Silveira Isoba, Rodrigo Ignacio, Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII), Universidad de Sevilla. FQM164: Matemática Discreta: Teoría de Grafos y Geometría Computacional, Claverol Aguas, Mercé, Garijo Royo, Delia, Korman, Matias, Seara Ojea, Carlos, and Silveira Isoba, Rodrigo Ignacio

Abstract

Given a set S of n line segments in the plane, we say that a region R R2 is a stabber for S if R contains exactly one endpoint of each segment of S. In this paper we provide optimal or near-optimal algorithms for reporting all combinatorially di erent stabbers for several shapes of stabbers. Speci cally, we consider the case in which the stabber can be described as the intersection of axis-parallel halfplanes (thus the stabbers are halfplanes, strips, quadrants, 3-sided rectangles, or rectangles). The running times are O(n) (for the halfplane case), O(n log n) (for strips, quadrants, and 3-sided rectangles), and O(n2 log n) (for rectangles).

Published
2017

16. Covering points by disjoint boxes with outliers

Author

Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science, Demaine, Erik D., Demaine, Martin L., Ahn, Hee-Kap, Bae, Sang Won, Kim, Sang-Sub, Korman, Matias, Reinbacher, Iris, Son, Wanbin, Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science, Demaine, Erik D., Demaine, Martin L., Ahn, Hee-Kap, Bae, Sang Won, Kim, Sang-Sub, Korman, Matias, Reinbacher, Iris, and Son, Wanbin

Abstract

For a set of n points in the plane, we consider the axis-aligned (p,k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain at least n−k points. In this paper, we consider the boxes to be either squares or rectangles, and we want to minimize the area of the largest box. For general p we show that the problem is NP-hard for both squares and rectangles. For a small, fixed number p, we give algorithms that find the solution in the following running times: For squares we have O(n+klogk) time for p=1, and O(nlogn+k[superscript p]log[superscript p]k) time for p=2,3. For rectangles we get O(n+k[superscript 3]) for p=1 and O(nlogn+k[superscript 2+p]log[superscript p−1]k) time for p=2,3. In all cases, our algorithms use O(n) space., Korea (South). Ministry of Education, Science and Technology (MEST) (National Research Foundation of Korea. Basic Science Research Program 2009-0067195), Brain Korea 21 Project, Korea (South). GRRC Program of Gyeonggi Province (Contents Convergence Software Research Center)

Published
2015

Catalog

Books, media, physical & digital resources
See catalog results