default search action
Antoine Vigneron
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j37]Chaeyoon Chung
, Antoine Vigneron
Maximum Coverage by k Lines. Symmetry 16(2): 206 (2024) - [i14]Eunku Park, Antoine Vigneron:
Embeddings and near-neighbor searching with constant additive error for hyperbolic spaces. CoRR abs/2402.14604 (2024) - 2022
- [j36]Hyeyun Yang
Coordinated Path Planning through Local Search and Simulated Annealing. ACM J. Exp. Algorithmics 27: 3.3:1-3.3:14 (2022) - 2021
- [j35]Hyeyun Yang, Antoine Vigneron:
Matching sets of line segments. Theor. Comput. Sci. 866: 82-95 (2021) - [c31]Hyeyun Yang, Antoine Vigneron:
A Simulated Annealing Approach to Coordinated Motion Planning (CG Challenge). SoCG 2021: 65:1-65:9 - [c30]Corentin Allair, Antoine Vigneron
Pattern Matching in Doubling Spaces. WADS 2021: 57-70 - 2020
- [i13]Corentin Allair, Antoine Vigneron:
Pattern Matching in Doubling Spaces. CoRR abs/2012.10919 (2020)
2010 – 2019
- 2019
- [j34]Hee-Kap Ahn
Faster algorithms for growing prioritized disks and rectangles. Comput. Geom. 80: 23-39 (2019) - [j33]Sang Won Bae
Tight bounds for beacon-based coverage in simple rectilinear polygons. Comput. Geom. 80: 40-52 (2019) - [j32]Aditya Bhaskara, Antoine Vigneron:
Approximating a planar convex set using a sparse grid. Inf. Process. Lett. 149: 10-13 (2019) - [c29]Hyeyun Yang, Antoine Vigneron
Matching Sets of Line Segments. WALCOM 2019: 261-273 - 2017
- [j31]Siu-Wing Cheng, Man-Kwun Chiu, Jiongxin Jin, Antoine Vigneron
Navigating Weighted Regions with Scattered Skinny Tetrahedra. Int. J. Comput. Geom. Appl. 27(1-2): 13-32 (2017) - [j30]Juyoung Yon, Siu-Wing Cheng
Finding Largest Common Point Sets. Int. J. Comput. Geom. Appl. 27(3): 177-186 (2017) - [c28]Daniel Binham, Pedro Machado Manhães de Castro, Antoine Vigneron
Reachability in a Planar Subdivision with Direction Constraints. SoCG 2017: 17:1-17:15 - [c27]Hee-Kap Ahn
Faster Algorithms for Growing Prioritized Disks and Rectangles. ISAAC 2017: 3:1-3:13 - [i12]Hee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron:
Faster Algorithms for Growing Prioritized Disks and Rectangles. CoRR abs/1704.07580 (2017) - 2016
- [j29]Siu-Wing Cheng
A Faster Algorithm for Computing Straight Skeletons. ACM Trans. Algorithms 12(3): 44:1-44:21 (2016) - [c26]Sang Won Bae
Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons. LATIN 2016: 110-122 - 2015
- [j28]Hervé Fournier, Anas Ismail
Computing the Gromov hyperbolicity of a discrete metric space. Inf. Process. Lett. 115(6-8): 576-579 (2015) - [c25]Anas Ismail, Antoine Vigneron
A New Trajectory Similarity Measure for GPS Data. IWGS 2015: 19-22 - [c24]Siu-Wing Cheng
Navigating Weighted Regions with Scattered Skinny Tetrahedra. ISAAC 2015: 35-45 - [c23]Siu-Wing Cheng
Triangulation Refinement and Approximate Shortest Paths in Weighted Regions. SODA 2015: 1626-1640 - [i11]Sang Won Bae, Chan-Su Shin, Antoine Vigneron:
Improved Bounds for Beacon-Based Coverage and Routing in Simple Rectilinear Polygons. CoRR abs/1505.05106 (2015) - 2014
- [j27]Hee-Kap Ahn
A Generalization of the Convex Kakeya Problem. Algorithmica 70(2): 152-170 (2014) - [j26]Antoine Vigneron
A Faster Algorithm for Computing Motorcycle Graphs. Discret. Comput. Geom. 52(3): 492-514 (2014) - [j25]Hee-Kap Ahn
Guest Editors' Foreword. Int. J. Comput. Geom. Appl. 24(4): 259-260 (2014) - [j24]Antoine Vigneron
Geometric optimization and sums of algebraic functions. ACM Trans. Algorithms 10(1): 4:1-4:20 (2014) - [c22]Siu-Wing Cheng
A Faster Algorithm for Computing Straight Skeletons. ESA 2014: 272-283 - [i10]Siu-Wing Cheng, Liam Mencel, Antoine Vigneron
A Faster Algorithm for Computing Straight Skeletons. CoRR abs/1405.4691 (2014) - 2013
- [j23]Hee-Kap Ahn
Covering and piercing disks with two centers. Comput. Geom. 46(3): 253-262 (2013) - [j22]Hee-Kap Ahn
Realistic roofs over a rectilinear polygon. Comput. Geom. 46(9): 1042-1055 (2013) - [j21]Hervé Fournier, Antoine Vigneron
A deterministic algorithm for fitting a step function to a weighted point-set. Inf. Process. Lett. 113(3): 51-54 (2013) - [c21]Antoine Vigneron, Lie Yan
A faster algorithm for computing motorcycle graphs. SoCG 2013: 17-26 - [i9]Antoine Vigneron, Lie Yan:
A Faster Algorithm for Computing Motorcycle Graphs. CoRR abs/1303.5958 (2013) - 2012
- [j20]Hee-Kap Ahn
Reachability by paths of bounded curvature in a convex polygon. Comput. Geom. 45(1-2): 21-32 (2012) - [j19]Hee-Kap Ahn
Computing the Discrete FRéChet Distance with Imprecise Input. Int. J. Comput. Geom. Appl. 22(1): 27-44 (2012) - [j18]Siu-Wing Cheng
Approximate Shortest Homotopic Paths in Weighted Regions. Int. J. Comput. Geom. Appl. 22(1): 83-102 (2012) - [c20]Hee-Kap Ahn
A Generalization of the Convex Kakeya Problem. LATIN 2012: 1-12 - [i8]Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron
Covering and Piercing Disks with Two Centers. CoRR abs/1201.1198 (2012) - [i7]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron
A Generalization of the Convex Kakeya Problem. CoRR abs/1209.2171 (2012) - [i6]Hervé Fournier, Anas Ismail, Antoine Vigneron
Computing the Gromov hyperbolicity of a discrete metric space. CoRR abs/1210.3323 (2012) - 2011
- [j17]Hervé Fournier, Antoine Vigneron
Fitting a Step Function to a Point Set. Algorithmica 60(1): 95-109 (2011) - [j16]Peter Brass
The Aligned k-Center Problem. Int. J. Comput. Geom. Appl. 21(2): 157-178 (2011) - [j15]Otfried Cheong
Reverse Nearest Neighbor Queries in Fixed Dimension. Int. J. Comput. Geom. Appl. 21(2): 179-188 (2011) - [c19]Hee-Kap Ahn
Covering and Piercing Disks with Two Centers. ISAAC 2011: 50-59 - [c18]Hee-Kap Ahn
Generating Realistic Roofs over a Rectilinear Polygon. ISAAC 2011: 60-69 - [i5]Hervé Fournier, Antoine Vigneron
A deterministic algorithm for fitting a step function to a weighted point-set. CoRR abs/1109.1152 (2011) - 2010
- [j14]Siu-Wing Cheng
Querying Approximate Shortest Paths in Anisotropic Regions. SIAM J. Comput. 39(5): 1888-1918 (2010) - [c17]Siu-Wing Cheng
Approximate Shortest Homotopic Paths in Weighted Regions. ISAAC (2) 2010: 109-120 - [c16]Hee-Kap Ahn
Computing the Discrete Fréchet Distance with Imprecise Input. ISAAC (2) 2010: 422-433 - [c15]Antoine Vigneron:
Geometric Optimization and Sums of Algebraic Functions. SODA 2010: 906-917 - [i4]Hee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron:
Reachability by Paths of Bounded Curvature in a Convex Polygon. CoRR abs/1008.4244 (2010)
2000 – 2009
- 2009
- [i3]Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron:
Computing k-Centers On a Line. CoRR abs/0902.3282 (2009) - [i2]Otfried Cheong, Antoine Vigneron, Juyoung Yon:
Reverse nearest neighbor queries in fixed dimension. CoRR abs/0905.4441 (2009) - 2008
- [j13]Boris Aronov
Sparse geometric graphs with small dilation. Comput. Geom. 40(3): 207-219 (2008) - [j12]Siu-Wing Cheng
Approximate Shortest Paths in Anisotropic Regions. SIAM J. Comput. 38(3): 802-824 (2008) - [c14]Sunil Arya, David M. Mount
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces. ESA 2008: 112-123 - [c13]Hervé Fournier, Antoine Vigneron:
Fitting a Step Function to a Point Set. ESA 2008: 442-453 - 2007
- [j11]Siu-Wing Cheng
Motorcycle Graphs and Straight Skeletons. Algorithmica 47(2): 159-182 (2007) - [j10]Hervé Fournier, Antoine Vigneron
A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope. Algorithmica 49(3): 245-257 (2007) - [j9]Hee-Kap Ahn
Maximizing the overlap of two planar convex sets under rigid motions. Comput. Geom. 37(1): 3-15 (2007) - [c12]Siu-Wing Cheng
Querying approximate shortest paths in anisotropic regions. SCG 2007: 84-91 - [c11]Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Yajun Wang:
Approximate shortest paths in anisotropic regions. SODA 2007: 766-774 - [i1]Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron:
Sparse geometric graphs with small dilation. CoRR abs/cs/0702080 (2007) - 2006
- [j8]Hee-Kap Ahn
Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets. Comput. Geom. 33(3): 152-164 (2006) - [c10]Hervé Fournier, Antoine Vigneron
Lower Bounds for Geometric Diameter Problems. LATIN 2006: 467-478 - 2005
- [j7]Helmut Alt, Otfried Cheong
The Voronoi Diagram of Curved Objects. Discret. Comput. Geom. 34(3): 439-453 (2005) - [c9]Kumar Gaurav Bijay, Antoine Vigneron:
A practical approach to approximating diameter of point-set in low dimensions. CCCG 2005: 3-6 - [c8]Hee-Kap Ahn
Maximizing the overlap of two planar convex sets under rigid motions. SCG 2005: 356-363 - [c7]Boris Aronov
Sparse Geometric Graphs with Small Dilation. ISAAC 2005: 50-59 - 2004
- [j6]Prosenjit Bose
Packing two disks into a polygonal environment. J. Discrete Algorithms 2(3): 373-380 (2004) - [c6]Hee-Kap Ahn, Peter Braß, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron:
Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon. COCOON 2004: 259-267 - 2003
- [j5]Antoine Vigneron
Reporting intersections among thick objects. Inf. Process. Lett. 85(2): 87-92 (2003) - [j4]Otfried Cheong
Computing farthest neighbors on a convex polytope. Theor. Comput. Sci. 296(1): 47-58 (2003) - [j3]Rob Duncan, Jianbo Qian, Antoine Vigneron
Polynomial time algorithms for three-label point labeling. Theor. Comput. Sci. 296(1): 75-87 (2003) - 2002
- [j2]Jean-Daniel Boissonnat, Antoine Vigneron
An elementary algorithm for reporting intersections of red/blue curve segments. Comput. Geom. 21(3): 167-175 (2002) - [c5]Siu-Wing Cheng, Antoine Vigneron:
Motorcycle graphs and straight skeletons. SODA 2002: 156-165 - 2001
- [c4]Prosenjit Bose, Pat Morin
Packing Two Disks into a Polygonal Environment. COCOON 2001: 142-149 - [c3]Otfried Cheong, Chan-Su Shin, Antoine Vigneron:
Computing Farthest Neighbors on a Convex Polytope. COCOON 2001: 159-169 - 2000
- [j1]Antoine Vigneron, Lixin Gao, Mordecai J. Golin
An algorithm for finding a k-median in a directed tree. Inf. Process. Lett. 74(1-2): 81-88 (2000) - [c2]Jean-Daniel Boissonnat, Antoine Vigneron:
An Elementary Algorithm for Reporting Intersections of Red/Blue Curve Segments. CCCG 2000 - [c1]Hee-Kap Ahn, Otfried Cheong
Reachability by paths of bounded curvature in convex polygons. SCG 2000: 251-259
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: