Path Simplification under Difference Area Measure
Publish place: 14th annual International CSI Computer Conference
Publish Year: 1388
نوع سند: مقاله کنفرانسی
زبان: English
View: 2,487
متن کامل این Paper منتشر نشده است و فقط به صورت چکیده یا چکیده مبسوط در پایگاه موجود می باشد.
توضیح: معمولا کلیه مقالاتی که کمتر از ۵ صفحه باشند در پایگاه سیویلیکا اصل Paper (فول تکست) محسوب نمی شوند و فقط کاربران عضو بدون کسر اعتبار می توانند فایل آنها را دریافت نمایند.
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
CSICC14_107
تاریخ نمایه سازی: 24 خرداد 1388
Abstract:
In this paper , we consider path simplification problem under difference area ( diff-area ) measure , Diff- area measure is defined as [AA(Q)-AB(Q)] is the area under Q and above P and AB(Q) is the area above Q and under P (see Figure 1 ) . Bose et al . [1] presented an approximation algorithm for finding a simplified path with at most K vertices that minimizes the diff - area measure whch only works on x - monotone paths . The constraint of being , - monotone is restrictive in some applications like tracking bird migration paths or map boundary simplification . Here , we extend the method of Bose et al . [1] and present algorithms with the same time complxities as theirs for general paths.
Authors
Shervin Daneshpajouh
Department of Computer Enginering, Sharif University of Technology, Tehran, Iran
Alireza Zarei
Department of Computer Enginering, Sharif University of Technology, Tehran, Iran
Mohammad Ghodsi
Sharif University of Technology Computer Engineering Department & School of Computer Science Institue for Research in Fundamental Science (IPM), Tehran, Iran