Titlebook: Computing and Combinatorics; 24th International C Lusheng Wang,Daming Zhu Conference proceedings 2018 Springer International Publishing AG,

使成波狀

Polygon Queries for Convex Hulls of Points,that given an .-oriented convex polygon . as a query, the convex hull of ., and its perimeter and area, can be reported efficiently, where an .-oriented polygon is a polygon whose edges have orientations in .. We present a data structure with . space and . construction time, and a query algorithm to

Incorruptible

flaunt

Cophenetic Distances: A Near-Linear Time Algorithmic Framework,ee metric introduced by Cardona et al. that originates from the pioneering work of Sokal and Rohlf more than 50 years ago. However, when faced with phylogenetic analyses where sets of large-scale trees are compared, the quadratic runtime of the current best-known (na?ve) algorithm to compute the cop

Heart-Rate

ELATE

institute

Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph,ces. We show that a variant, where the objective function is not the number of paths but the number of length-0 paths (that is, isolated vertices), turns out to be polynomial-time solvable. We further show that another variant, where the objective function is the total number of length-0 and length-

半導體

昏睡中

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/234761.jpg

figment

沒有希望

https://doi.org/10.1007/978-1-4020-5672-7We provide efficient algorithms for computing compact representations of Voronoi diagrams using a convex-straight-skeleton (i.e., convex polygon offset) distance function when sites are line segments or convex polygons.