BROWSE

사진

  • ResearcherID
  • ORCiD
  • Scopus
  • Google Citations

Vigneron, Antoine (VigneronAntoine)

Department
School of Electrical and Computer Engineering(전기전자컴퓨터공학부)
Research Interests
Computational geometry, algorithms design and analysis, computational complexity
Lab
Geometric Algorithms Lab
E-Mail
antoine@unist.ac.kr
Website
This table browses all dspace content
Issue DateTitleAuthor(s)TypeViewAltmetrics
201606A Faster Algorithm for Computing Straight SkeletonsCheng, Siu-Wing; Mencel, Liam; Vigneron, AntoineARTICLE175 A Faster Algorithm for Computing Straight Skeletons
201507Computing the Gromov hyperbolicity of a discrete metric spaceFournier, Herve; Ismail, Anas; Vigneron, AntoineARTICLE175 Computing the Gromov hyperbolicity of a discrete metric space
201410A Generalization of the Convex Kakeya ProblemAhn, Hee-Kap; Bae, Sang Won; Cheong, Otfried, et alARTICLE115 A Generalization of the Convex Kakeya Problem
201410A Faster Algorithm for Computing Motorcycle GraphsVigneron, Antoine; Yan, LieARTICLE115 A Faster Algorithm for Computing Motorcycle Graphs
201401Geometric Optimization and Sums of Algebraic FunctionsVigneron, AntoineARTICLE113 Geometric Optimization and Sums of Algebraic Functions
201311Realistic roofs over a rectilinear polygonAhn, Hee-Kap; Bae, Sang Won; Knauer, Christian, et alARTICLE124 Realistic roofs over a rectilinear polygon
201304Covering and piercing disks with two centersAhn, Hee-Kap; Kim, Sang-Sub; Knauer, Christian, et alARTICLE118 Covering and piercing disks with two centers
201302A deterministic algorithm for fitting a step function to a weighted point-setFournier, Herve; Vigneron, AntoineARTICLE111 A deterministic algorithm for fitting a step function to a weighted point-set
201202APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONSCheng, Siu-Wing; Jin, Jiongxin; Vigneron, Antoine, et alARTICLE107 APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS
201202COMPUTING THE DISCRETE FRECHET DISTANCE WITH IMPRECISE INPUTAhn, Hee-Kap; Knauer, Christian; Scherfenberg, Marc, et alARTICLE166 COMPUTING THE DISCRETE FRECHET DISTANCE WITH IMPRECISE INPUT
201201Reachability by paths of bounded curvature in a convex polygonAhn, Hee-Kap; Cheong, Otfried; Matousek, Jiri, et alARTICLE120 Reachability by paths of bounded curvature in a convex polygon
201105Fitting a Step Function to a Point SetFournier, Herve; Vigneron, AntoineARTICLE103 Fitting a Step Function to a Point Set
201104REVERSE NEAREST NEIGHBOR QUERIES IN FIXED DIMENSIONCheong, Otfried; Vigneron, Antoine; Yon, JuyoungARTICLE92 REVERSE NEAREST NEIGHBOR QUERIES IN FIXED DIMENSION
201104THE ALIGNED K-CENTER PROBLEMBrass, Peter; Knauer, Christian; Na, Hyeon-Suk, et alARTICLE144 THE ALIGNED K-CENTER PROBLEM
2010QUERYING APPROXIMATE SHORTEST PATHS IN ANISOTROPIC REGIONSCheng, Siu-Wing; Na, Hyeon-Suk; Vigneron, Antoine, et alARTICLE88 QUERYING APPROXIMATE SHORTEST PATHS IN ANISOTROPIC REGIONS
200808Sparse geometric graphs with small dilationAronov, Boris; de Berg, Mark; Cheong, Otfried, et alARTICLE106 Sparse geometric graphs with small dilation
2008Approximate shortest paths in anisotropic regionsCheng, Siu-Wing; Na, Hyeon-Suk; Vigneron, Antoine, et alARTICLE121 Approximate shortest paths in anisotropic regions
200711A tight lower bound for computing the diameter of a 3D convex polytopeFournier, Herve; Vigneron, AntoineARTICLE124 A tight lower bound for computing the diameter of a 3D convex polytope
200705Maximizing the overlap of two planar convex sets under rigid motionsAhn, Hee-Kap; Cheong, Otfried; Park, Chong-Dae, et alARTICLE104 Maximizing the overlap of two planar convex sets under rigid motions
200702Motorcycle graphs and straight skeletonsCheng, Siu-Wing; Vigneron, AntoineARTICLE97 Motorcycle graphs and straight skeletons

MENU