Author image not provided
 Haitao Wang

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article1.16
Citation Count29
Publication count25
Publication years2013-2017
Available for download4
Average downloads per article246.25
Downloads (cumulative)985
Downloads (12 Months)115
Downloads (6 Weeks)9
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


25 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 25
Result page: 1 2

Sort by:

1
May 2017 Algorithmica: Volume 78 Issue 1, May 2017
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

Uncertain data has been very common in many applications. In this paper, we consider the one-center problem for uncertain data on tree networks. In this problem, we are given a tree T and n (weighted) uncertain points each of which has m possible locations on T associated with probabilities. The ...
Keywords: One-center, Algorithms and data structures, Uncertain data, Facility location, Tree network

2
May 2017 Algorithmica: Volume 78 Issue 1, May 2017
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

We consider an interval coverage problem. Given n intervals of the same length on a line L and a line segment B on L, we want to move the intervals along L such that every point of B is covered by at least one interval and the sum of the ...
Keywords: Algorithms and data structures, Mobile sensors, Barrier coverage, Computational geometry, Interval coverage, min-sum

3
April 2017 Discrete & Computational Geometry: Volume 57 Issue 3, April 2017
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

For a polygonal domain with h holes and a total of n vertices, we present algorithms that compute the $$L_1$$L1 geodesic diameter in $$O(n^2+h^4)$$O(n2+h4) time and the $$L_1$$L1 geodesic center in $$O((n^4+n^2 h^4)\alpha (n))$$O((n4+n2h4)ź(n)) time, respectively, where $$\alpha (\cdot )$$ź(·) denotes the inverse Ackermann function. No algorithms were known for ...
Keywords: Geodesic diameter, 68W05, Polygonal domains, Shortest paths, $$L_1$$L1 metric, Geodesic center, 68W40

4
January 2017 Algorithmica: Volume 77 Issue 1, January 2017
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

Given a set $${\mathcal {P}}$$P of h pairwise-disjoint polygonal obstacles with a total of n vertices in the plane, we study the problem of computing the (weak) visibility polygon from a polygonal obstacle $$P^*$$Pź (an island) in $${\mathcal {P}}$$P. The problem was previously solved in $$O(n^4)$$O(n4) time, which has been ...
Keywords: Algorithms, Computational geometry, Polygon with holes, Visibility polygons, Polygonal domains

5
May 2016 Algorithmica: Volume 75 Issue 1, May 2016
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

In the classic k-center problem, we are given a metric graph, and the objective is to select k nodes as centers such that the maximum distance from any vertex to its closest center is minimized. In this paper, we consider two important generalizations of k-center, the matroid center problem and ...
Keywords: k-median, Fault-tolerant, k-center

6
May 2016 Operations Research Letters: Volume 44 Issue 3, May 2016
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 0

We consider the one-dimensional one-center problem on uncertain data. We are given a set P of n (weighted) uncertain points on a real line L and each uncertain point is specified by a probability density function that is a piecewise-uniform function (i.e., a histogram). The goal is to find a ...
Keywords: Lowest point, One-center, Upper envelope, Histogram, Algorithms, Uncertain data

7
April 2016 IEEE Transactions on Information Forensics and Security: Volume 11 Issue 4, April 2016
Publisher: IEEE Press
Bibliometrics:
Citation Count: 0

Geometric range search is a fundamental primitive for spatial data analysis in SQL and NoSQL databases. It has extensive applications in location-based services, computer-aided design, and computational geometry. Due to the dramatic increase in data size, it is necessary for companies and organizations to outsource their spatial data sets to ...

8
January 2016 Theoretical Computer Science: Volume 609 Issue P1, January 2016
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 0

Given a set P of n uncertain points on the real line, each represented by its one-dimensional probability density function, we consider the problem of building data structures on P to answer range queries of the following three types for any query interval I: (1) top-1 query: find a point ...
Keywords: Data structures, Threshold queries, Top-k queries, Range queries, Algorithms, Uncertain data

9
October 2015 Theoretical Computer Science: Volume 602 Issue C, October 2015
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 2

Problems on uncertain data have attracted significant attention due to the imprecise nature of many measurement data. In this paper, we consider the k-center problem on one-dimensional uncertain data. The input is a set P of (weighted) uncertain points on a real line, and each uncertain point is specified by ...
Keywords: Algorithms and data structures, Uncertain data, k-center, Computational geometry, Facility locations

10
August 2015 Theoretical Computer Science: Volume 593 Issue C, August 2015
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 0

We study the computational complexity of the puzzle Quell. The goal is to collect pearls by sliding a droplet of water over them in a map that is a two-dimensional grid. Each cell of the grid is either a free space (possibly with a pearl in it) or an obstacle. ...
Keywords: Approximation algorithms, Hardness of approximation, Traveling salesman problem, Fixed-parameter tractability, Combinatorial game theory

11
August 2015 Theoretical Computer Science: Volume 592 Issue C, August 2015
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 2

We consider the problem of finding k centers for n weighted points on a real line. This (weighted) k-center problem was solved in O ( n log � n ) time previously by using Cole's parametric search and other complicated approaches. In this paper, we present an easier O ( ...
Keywords: 2-D sublist LP queries, One-dimension, Algorithms, k-center, Computational geometry, Data structures, Facility locations

12
August 2015 Computational Geometry: Theory and Applications: Volume 48 Issue 6, August 2015
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 2

In this paper, we show that the L 1 geodesic diameter and center of a simple polygon can be computed in linear time. For the purpose, we focus on revealing basic geometric properties of the L 1 geodesic balls, that is, the metric balls with respect to the L 1 ...
Keywords: Geodesic center, Simple polygon, Geodesic diameter, L1 metric

13
August 2015 Computational Geometry: Theory and Applications: Volume 48 Issue 6, August 2015
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 1

Given a simple polygon P in the plane, we present new data structures for computing the weak visibility polygon from any query line segment in P. We build a data structure in O ( n ) time and space that can compute the visibility polygon for any query line segment ...
Keywords: Visibility queries, Visibility polygons, Weak visibility from line segments, Zone theorem

14
July 2015 Operations Research Letters: Volume 43 Issue 4, July 2015
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 0

We study a problem on splitting intervals. Let I be a set of n intervals on a line L , with non-negative weights. Given any integer k � 1 , we want to find k points on L to partition L into k + 1 segments, such that the maximum ...
Keywords: Multi-version databases, Temporal databases, Interval splitting, Algorithms, Combinatorial optimizations

15
June 2015 Algorithmica: Volume 72 Issue 2, June 2015
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

Given n points in a circular region C in the plane, we study the problems of moving the n points to the boundary of G to form a regular n-gon such that the maximum (min-max) or the sum (min-sum) of the Euclidean distances traveled by the points is minimized. These ...
Keywords: Barrier coverage, Computational geometry, Circular convex bipartite graph, Dynamic maximum matching, Algorithms and data structures, Circular region coverage, Mobile sensors

16
May 2015 Discrete Applied Mathematics: Volume 187 Issue C, May 2015
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 0

We consider computing a maximum non-crossing matching in convex bipartite graphs. For a convex bipartite graph of n vertices and m edges, we present an O ( n log n ) time algorithm for finding a maximum non-crossing matching in the graph. The previous best algorithm takes O ( m ...
Keywords: Convex bipartite graphs, Algorithms, Maximum non-crossing matching, Data structures, Maximum matching

17 published by ACM
April 2015 ACM Transactions on Algorithms (TALG): Volume 11 Issue 4, June 2015
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 5,   Downloads (12 Months): 38,   Downloads (Overall): 282

Full text available: PDFPDF
A fundamental problem in computational geometry is to compute an obstacle-avoiding Euclidean shortest path between two points in the plane. The case of this problem on polygonal obstacles is well studied. In this article, we consider the problem version on curved obstacles, which are commonly modeled as splinegons . A ...
Keywords: tangent graphs, curved obstacles, Shortest paths, Voronoi diagrams

18
October 2014 Computational Geometry: Theory and Applications: Volume 48 Issue 2, February, 2015
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 1

Given a polygonal domain (or polygon with holes) in the plane, we study the problem of computing the visibility polygon of any query point. As a special case of visibility problems, we also study the ray-shooting problem of finding the first point on the polygon boundaries that is hit by ...
Keywords: Visibility queries, Visibility polygons, Polygonal domains, Ray-shootings, Algorithms

19 published by ACM
June 2014 SOCG'14: Proceedings of the thirtieth annual symposium on Computational geometry
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 2,   Downloads (12 Months): 23,   Downloads (Overall): 153

Full text available: PDFPDF
Let P be a set of h pairwise-disjoint polygonal obstacles with a total of n vertices in the plane. In this paper, we consider the problem of building a data structure that can quickly compute an L1 shortest obstacle-avoiding path between any two query points s and t. We build ...
Keywords: polygons with holes, L1 metric, Shortest paths, polygonal domains, two-point queries, weighted rectilinear obstacles

20 published by ACM
June 2014 ASIA CCS '14: Proceedings of the 9th ACM symposium on Information, computer and communications security
Publisher: ACM
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 2,   Downloads (12 Months): 40,   Downloads (Overall): 419

Full text available: PDFPDF
Cloud computing promises users massive scale outsourced data storage services with much lower costs than traditional methods. However, privacy concerns compel sensitive data to be stored on the cloud server in an encrypted form. This posts a great challenge for effectively utilizing cloud data, such as executing common SQL queries. ...
Keywords: multiple dimension, tree structures, range search, encrypted cloud data



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us