KwangSoo Yang

Learn More
Increasingly, location-aware datasets are of a size, variety, and update rate that exceeds the capability of spatial computing technologies. This paper addresses the emerging challenges posed by such datasets, which we call Spatial Big Data (SBD). SBD examples include trajectories of cellphones and GPS devices, vehicle engine measurements, temporally(More)
Given a spatio-temporal network, a source, a destination, and a start-time interval, the All-start-time Lagrangian Shortest Paths (ALSP) problem determines a path set which includes the shortest path for every start time in the given interval. ALSP is important for critical societal applications related to air travel, road travel, and other spatiotemporal(More)
Given a set of operators and a spatio-temporal network, the goal of the Storing Spatio-Temporal Networks (SSTN) problem is to produce an efficient data storage method that minimizes disk I/O access costs. Storing and accessing spatio-temporal networks is increasingly important in many societal applications such as transportation management and emergency(More)
Recent years have seen the emergence of many new and valuable spatial datasets. Examples include trajectories of cell-phones and Global Positioning System (GPS) devices, vehicle engine measurements, global climate models (GCM) simulation data, volunteered geographic information (VGI), geosocial media, tweets, etc. The value of these datasets is already(More)
Spatial computing is a set of ideas and technologies that facilitate understanding the geo-physical world, knowing and communicating relations to places in that world, and navigating through those places. The transformational potential of mobility services is already evident. From Google Maps [17] to consumer Global Positioning System (GPS) devices, society(More)
Experiences with evacuation route planning algorithms Shashi Shekhar a , KwangSoo Yang a , Venkata M.V. Gunturi a , Lydia Manikonda a , Dev Oliver a , Xun Zhou a , Betsy George b , Sangho Kim c , Jeffrey M.R. Wolff a & Qingsong Lu a a Department of Computer Science and Engineering University of Minnesota, Minneapolis, MN, USA b Oracle, Nashua, NH, USA c(More)
Given a graph and a set of service center nodes, a Capacity Constrained Network-Voronoi Diagram (CCNVD) partitions the graph into a set of contiguous service areas that meet service center capacities and minimize the sum of the shortest distances from graph-nodes to allotted service centers. The CCNVD problem is important for critical societal applications(More)
Given a spatio-temporal network, a source, a destination, and a desired departure time interval, the All-departure-time Lagrangian Shortest Paths (ALSP) problem determines a set which includes the shortest path for every departure time in the given interval. ALSP is important for critical societal applications such as eco-routing. However, ALSP is(More)