Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

Banner header
61.690 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
  • Ponències/Comunicacions de congressos
  • View Item
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
  • Ponències/Comunicacions de congressos
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Flow computations on imprecise terrains

Thumbnail
View/Open
Flow-computations-on-imprecise-terrains.pdf (272,6Kb) (Restricted access)
 
10.1007/978-3-642-22300-6_30
 
  View Usage Statistics
  LA Referencia / Recolecta stats
Cita com:
hdl:2117/13873

Show full item record
Driemel, Anne
Haverkort, Herman
Löffler, Maarten
Silveira, Rodrigo IgnacioMés informacióMés informacióMés informació
Document typeConference report
Defense date2011
PublisherSpringer Verlag
Rights accessRestricted access - confidentiality agreement
Attribution-NonCommercial-NoDerivs 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain
ProjectMFHQTERRAINS - Mathematical Foundations of High-Quality Terrain Models (EC-FP7-251235)
Abstract
We study water flow computation on imprecise terrains. We consider two approaches to modeling flow on a terrain: one where water flows across the surface of a polyhedral terrain in the direction of steepest descent, and one where water only flows along the edges of a predefined graph, for example a grid or a triangulation. In both cases each vertex has an imprecise elevation, given by an interval of possible values, while its (x, y)-coordinates are fixed. For the first model, we show that the problem of deciding whether one vertex may be contained in the watershed of another is NP-hard. In contrast, for the second model we give a simple O(n log n) time algorithm to compute the minimal and the maximal watershed of a vertex, where n is the number of edges of the graph. On a grid model, we can compute the same in O(n) time.
CitationDriemel, A. [et al.]. Flow computations on imprecise terrains. A: Algorithms and Data Structures Symposium. "2011 Workshop on Algorithms and Data Structures Symposium (WADS)". Brooklyn: Springer Verlag, 2011, p. 350-361. 
URIhttp://hdl.handle.net/2117/13873
DOI10.1007/978-3-642-22300-6_30
ISBN978-3-642-22299-3
Publisher versionhttp://cataleg.upc.edu/record=b1390385~S1*cat
Collections
  • DCCG - Grup de recerca en geometria computacional, combinatoria i discreta - Ponències/Comunicacions de congressos [68]
  • Departament de Matemàtiques - Ponències/Comunicacions de congressos [1.057]
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
Flow-computations-on-imprecise-terrains.pdfBlocked272,6KbPDFRestricted access

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Contact Us
  • Send Feedback
  • Privacy Settings
  • Inici de la pàgina