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
Website
This table browses all dspace content
Issue DateTitleAuthor(s)TypeViewAltmetrics
201709Finding largest common point setsYon, Juyoung; Cheng, Siu-Wing; Cheong, Otfried, et alARTICLE74 Finding largest common point sets
201703Navigating weighted regions with scattered skinny tetrahedraCheng, Siu-Wing; Chiu, Man-Kwun; Jin, Jiongxin, et alARTICLE143 Navigating weighted regions with scattered skinny tetrahedra
201606A Faster Algorithm for Computing Straight SkeletonsCheng, Siu-Wing; Mencel, Liam; Vigneron, AntoineARTICLE310 A Faster Algorithm for Computing Straight Skeletons
201507Computing the Gromov hyperbolicity of a discrete metric spaceFournier, Herve; Ismail, Anas; Vigneron, AntoineARTICLE343 Computing the Gromov hyperbolicity of a discrete metric space
201410A Generalization of the Convex Kakeya ProblemAhn, Hee-Kap; Bae, Sang Won; Cheong, Otfried, et alARTICLE179 A Generalization of the Convex Kakeya Problem
201410A Faster Algorithm for Computing Motorcycle GraphsVigneron, Antoine; Yan, LieARTICLE235 A Faster Algorithm for Computing Motorcycle Graphs
201401Geometric Optimization and Sums of Algebraic FunctionsVigneron, AntoineARTICLE269 Geometric Optimization and Sums of Algebraic Functions
201311Realistic roofs over a rectilinear polygonAhn, Hee-Kap; Bae, Sang Won; Knauer, Christian, et alARTICLE269 Realistic roofs over a rectilinear polygon
201304Covering and piercing disks with two centersAhn, Hee-Kap; Kim, Sang-Sub; Knauer, Christian, et alARTICLE242 Covering and piercing disks with two centers
201302A deterministic algorithm for fitting a step function to a weighted point-setFournier, Herve; Vigneron, AntoineARTICLE215 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 alARTICLE227 APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS
201202COMPUTING THE DISCRETE FRECHET DISTANCE WITH IMPRECISE INPUTAhn, Hee-Kap; Knauer, Christian; Scherfenberg, Marc, et alARTICLE261 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 alARTICLE243 Reachability by paths of bounded curvature in a convex polygon
201105Fitting a Step Function to a Point SetFournier, Herve; Vigneron, AntoineARTICLE188 Fitting a Step Function to a Point Set
201104THE ALIGNED K-CENTER PROBLEMBrass, Peter; Knauer, Christian; Na, Hyeon-Suk, et alARTICLE259 THE ALIGNED K-CENTER PROBLEM
201104REVERSE NEAREST NEIGHBOR QUERIES IN FIXED DIMENSIONCheong, Otfried; Vigneron, Antoine; Yon, JuyoungARTICLE214 REVERSE NEAREST NEIGHBOR QUERIES IN FIXED DIMENSION
2010QUERYING APPROXIMATE SHORTEST PATHS IN ANISOTROPIC REGIONSCheng, Siu-Wing; Na, Hyeon-Suk; Vigneron, Antoine, et alARTICLE178 QUERYING APPROXIMATE SHORTEST PATHS IN ANISOTROPIC REGIONS
200808Sparse geometric graphs with small dilationAronov, Boris; de Berg, Mark; Cheong, Otfried, et alARTICLE189 Sparse geometric graphs with small dilation
2008Approximate shortest paths in anisotropic regionsCheng, Siu-Wing; Na, Hyeon-Suk; Vigneron, Antoine, et alARTICLE236 Approximate shortest paths in anisotropic regions
200711A tight lower bound for computing the diameter of a 3D convex polytopeFournier, Herve; Vigneron, AntoineARTICLE243 A tight lower bound for computing the diameter of a 3D convex polytope

MENU