Abstract: A network system determines and remediates dissimilarities between a digital map and trace data of a road network in an area as service providers and service requesters coordinate service using the road network in the area. To determine dissimilarities the network system can select and convert a digital map, aggregate received trace data into trace data accurately representing the road network in the area, generate a visualization of the dissimilarities, and remediate the dissimilarities using a variety of methods. A first remediation method includes verifying the dissimilarity using a single service provider, a second method includes verifying the dissimilarity leveraging multiple service providers, and a third method modifies the methods used to determine dissimilarities. After remediation, the network system can generate a map of the area that accurately represents the road network in the area.

Abstract: A network system determines and remediates dissimilarities between a digital map and trace data of a road network in an area as service providers and service requesters coordinate service using the road network in the area. To determine dissimilarities the network system can select and convert a digital map, aggregate received trace data into trace data accurately representing the road network in the area, generate a visualization of the dissimilarities, and remediate the dissimilarities using a variety of methods. A first remediation method includes verifying the dissimilarity using a single service provider, a second method includes verifying the dissimilarity leveraging multiple service providers, and a third method modifies the methods used to determine dissimilarities. After remediation, the network system can generate a map of the area that accurately represents the road network in the area.

Abstract: An input mesh can be decomposed into component meshes that can be independently simplified. A computing device can calculate costs of performing candidate edge collapses for a component mesh. The candidate edge collapses can include boundary edge collapses and interior edge collapses. To simplify a component mesh, the execution of boundary edge collapses and the execution of interior edge collapses are interleaved in an order based on the costs of performing the candidate edge collapses. The position of a vertex resulting from a boundary edge collapse can be calculated independently of the interior of the component mesh. When component meshes are simplified in parallel, a boundary that is common to the component meshes can be simplified identically.

Abstract: An input mesh can be decomposed into component meshes that can be independently simplified. A computing device can calculate costs of performing candidate edge collapses for a component mesh. The candidate edge collapses can include boundary edge collapses and interior edge collapses. To simplify a component mesh, the execution of boundary edge collapses and the execution of interior edge collapses are interleaved in an order based on the costs of performing the candidate edge collapses. The position of a vertex resulting from a boundary edge collapse can be calculated independently of the interior of the component mesh. When component meshes are simplified in parallel, a boundary that is common to the component meshes can be simplified identically.