Follow
Carlos Alegria
Title
Cited by
Cited by
Year
Rectilinear convex hull with minimum area
C Alegría-Galicia, T Garduno, A Rosas-Navarrete, C Seara, J Urrutia
Computational Geometry: XIV Spanish Meeting on Computational Geometry, EGC …, 2012
16*2012
On the Oβ-hull of a planar point set
C Alegría-Galicia, D Orden, C Seara, J Urrutia
Computational Geometry 68, 277-291, 2018
142018
Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
C Alegría Galicia, D Orden Martin, C Seara Ojea, J Urrutia Galicia
Journal of Global Optimization 79 (3), 687-714, 2021
13*2021
Separating bichromatic point sets in the plane by restricted orientation convex hulls
C Alegría, D Orden, C Seara, J Urrutia
Journal of Global Optimization 85 (4), 1003-1036, 2023
82023
On the O-hull of planar point sets
C Alegrıa-Galicia, D Orden, C Seara, J Urrutia
30th European Workshop on Computational Geometry (EuroCG), 2014
82014
Optimizing an oriented convex hull with two directions
C Alegrıa-Galicia, D Orden, C Seara, J Urrutia
31th European Workshop on Computational Geometry (EuroCG), 2015
52015
Computing containment relations between rectilinear convex hulls
C Alegrıa-Galicia, C Seara, J Urrutia
Mexican Conference on Discrete Mathematics and Computational Geometry, 60th …, 2013
52013
The Voronoi diagram of rotating rays with applications to floodlight illumination
C Alegría, I Mantas, E Papadopoulou, M Saviæ, C Seara, M Suderland
arXiv preprint arXiv:2304.11429, 2023
42023
Unit-length rectangular drawings of graphs
C Alegría, G Da Lozzo, G Di Battista, F Frati, F Grosso, M Patrignani
International Symposium on Graph Drawing and Network Visualization, 127-143, 2022
42022
Capturing points with a rotating polygon (and a 3D extension)
C Alegría-Galicia, D Orden, L Palios, C Seara, J Urrutia
Theory of Computing Systems 63, 543-566, 2019
32019
Hamiltonian meander paths and cycles on bichromatic point sets
O Aichholzer, C Alegría, I Parada, A Pilz, J Tejel, CD Tóth, J Urrutia, ...
XVIII Spanish Meeting on Computational Geometry, 35-38, 2019
32019
A 1/4-approximation algorithm for the maximum hidden vertex set problem in simple polygons
C Alegría, P Bhattacharya, SK Ghosh
European Workshop on Computational Geometry, 2019
32019
Illuminating polygons by edge-aligned floodlights of uniform angle (Brocard illumination)
C Alegría-Galicia, D Orden, C Seara, J Urrutia
Proc. European Workshop on Computational Geometry, 281-284, 2017
32017
Detecting inclusions for O-convex hulls of bichromatic point sets
C Alegrıa, D Orden, C Seara, J Urrutia
22019
Planar straight-line realizations of 2-trees with prescribed edge lengths
C Alegría, M Borrazzo, G Da Lozzo, G Di Battista, F Frati, M Patrignani
Graph Drawing and Network Visualization: 29th International Symposium, GD …, 2021
12021
The Oβ-hull of a planar point set and some applications
C Alegrıa-Galicia, D Orden, C Seara, J Urrutia
XVI Spanish Meeting on Computational Geometry (EGC 2015), 2015
12015
A Mediator for biospatial information systems
R Barrera, A Alcántara, C Alegría, AL Ávila, D Esparza
International Journal of Decision Support System Technology (IJDSST) 1 (2 …, 2009
12009
Upward Pointset Embeddings of Planar st-Graphs
C Alegria, S Caroppo, G Da Lozzo, M D'Elia, G Di Battista, F Frati, ...
arXiv preprint arXiv:2408.17369, 2024
2024
The Complexity of the Lower Envelope of Collections of Various Geometric Shapes
C Alegrıa, A Brötzner, BJ Nilsson, C Schmidt, C Seara
2024
The rectilinear convex hull of line segments
C Alegría, J Dallant, P Pérez-Lantero, C Seara
International Symposium on Fundamentals of Computation Theory, 32-45, 2023
2023
The system can't perform the operation now. Try again later.
Articles 1–20