Geometric matching algorithms for two realistic terrains

DOI10.1016/J.TCS.2018.01.011zbMATH Open1386.68203OpenAlexW2395525810MaRDI QIDQ683754FDOQ683754

Min-Gyu Kim, Wanbin Son, Sang Duk Yoon, Hee-Kap Ahn

Publication date: 9 February 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.01.011

Recommendations

• Geometric Matching Algorithms for Two Realistic Terrains
• Matching polyhedral terrains using overlays of envelopes
• Algorithm Theory - SWAT 2004
• Computing similarity between piecewise-linear functions
• Computing the Distance between Piecewise-Linear Bivariate Functions

zbMATH Keywords

geometric matching algorithmpiecewise-linear bivariate functionrealistic terrain

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• A subexponential bound for linear programming
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Dynamic Three-Dimensional Linear Programming
• Computing the Distance between Piecewise-Linear Bivariate Functions
• Computing Correlation between Piecewise-Linear Functions
• On realistic terrains

Cited In (3)

• Algorithm Theory - SWAT 2004
• Matching polyhedral terrains using overlays of envelopes
• Geometric Matching Algorithms for Two Realistic Terrains

This page was built for publication: Geometric matching algorithms for two realistic terrains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q683754)