2 + k) time for m regions composed with n line segments on average with k line segment intersections. A new O((n+k)(lg n+m+lg m2)) algorithm is presented to solve the MCP. The algorithm has been implemented and experiments show that it is significantly faster than the naive approach.">

Geometric and thematic integration of spatial data into maps (original) (raw)

IEEE Account

Purchase Details

Profile Information

Need Help?

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2026 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.