pdf

3D space contour query algorithm based on dynamic scanning theory

  • 2013-09-20
  • 300.3KB
  • Points it Requires : 2

Contour operations and contour calculations play an important role in applications such as database communication, decision support, data visualization, and spatial databases. This paper analyzes existing methods, points out their problems in progressive processing, query efficiency, and user convenience in post-screening, and proposes a 3D dynamic cut surface contour query algorithm based on the contour point dominance theorem and the application of spatial geometry principles. Its feasibility, efficiency, and accuracy are demonstrated through case analysis and experiments. Keywords: contour; dominance; progressive processing

unfold

You Might Like

Uploader
sinceyoulove
 

Recommended ContentMore

Popular Components

Just Take a LookMore

EEWorld
subscription
account

EEWorld
service
account

Automotive
development
circle

About Us Customer Service Contact Information Datasheet Sitemap LatestNews


Room 1530, 15th Floor, Building B, No.18 Zhongguancun Street, Haidian District, Beijing, Postal Code: 100190 China Telephone: 008610 8235 0740

Copyright © 2005-2024 EEWORLD.com.cn, Inc. All rights reserved 京ICP证060456号 京ICP备10001474号-1 电信业务审批[2006]字第258号函 京公网安备 11010802033920号
×