사진

  • ResearcherID
  • ORCiD
  • Scopus
  • Google Citations

Vigneron, Antoine (VigneronAntoine)

Department
Department of Computer Science and Engineering(컴퓨터공학과)
Website
http://algo.unist.ac.kr/
Lab
Geometric Algorithms Lab. (기하 알고리즘 연구실)
Research Keywords
계산 기하학, 알고리즘 설계 및 분석, 근사 알고리즘, 계산 복잡도, 조합 최적화, 경로 계획, 패턴 매칭, Computational geometry, algorithms design and analysis, Approximation Algorithms, Computational Complexity, Combinatorial Optimization, Path Planning, Pattern Matching
Research Interests
Our main research area is computational geometry. In particular, we design and analyze worst-case efficient algorithms for various geometric problems. Our recent research topics include geometric pattern matching and path planning under geometric constraints.
This table browses all dspace content
Issue DateTitleAuthor(s)TypeViewAltmetrics
2008-08Sparse geometric graphs with small dilationAronov, Boris; de Berg, Mark; Cheong, Otfried, et alARTICLE431 Sparse geometric graphs with small dilation
2008Approximate shortest paths in anisotropic regionsCheng, Siu-Wing; Na, Hyeon-Suk; Vigneron, Antoine, et alARTICLE496 Approximate shortest paths in anisotropic regions
2007-11A tight lower bound for computing the diameter of a 3D convex polytopeFournier, Herve; Vigneron, AntoineARTICLE501 A tight lower bound for computing the diameter of a 3D convex polytope
2007-05Maximizing the overlap of two planar convex sets under rigid motionsAhn, Hee-Kap; Cheong, Otfried; Park, Chong-Dae, et alARTICLE432 Maximizing the overlap of two planar convex sets under rigid motions
2007-02Motorcycle graphs and straight skeletonsCheng, Siu-Wing; Vigneron, AntoineARTICLE464 Motorcycle graphs and straight skeletons
2006-02Inscribing an axially symmetric polygon and other approximation algorithms for planar convex setsAhn, HK; Brass, P; Cheong, O, et alARTICLE481 Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
2005-09The Voronoi diagram of curved objectsAlt, H; Cheong, O; Vigneron, AARTICLE474 The Voronoi diagram of curved objects
2004-09Packing two disks into a polygonal environmentBose, Prosenjit; Morin, Pat; Vigneron, AntoineARTICLE385 Packing two disks into a polygonal environment
2003-03Polynomial time algorithms for three-label point labelingDuncan, R; Qian, JB; Vigneron, A, et alARTICLE361 Polynomial time algorithms for three-label point labeling
2003-03Computing farthest neighbors on a convex polytopeCheong, O; Shin, CS; Vigneron, AARTICLE422 Computing farthest neighbors on a convex polytope
2003-01Reporting intersections among thick objectsVigneron, AARTICLE457 Reporting intersections among thick objects
2002-03An elementary algorithm for reporting intersections of red/blue curve segmentsBoissonnat, JD; Vigneron, AARTICLE480 An elementary algorithm for reporting intersections of red/blue curve segments
2000-04An algorithm for finding a k-median in a directed treeVigneron, A; Gao, LX; Golin, MJ, et alARTICLE315 An algorithm for finding a k-median in a directed tree

MENU