Machine-translated by Google. Questions are authored in English.
Top

Discussion

A spaghetti data structure is one in which

  • A.all geometry is stored as a plain grid of cells
  • B.lines are stored with no topology recorded
  • C.every line is deliberately stored twice for safety
  • D.features are indexed by means of a spatial tree

Answer: B

Each line is an independent string of coordinates, and shared boundaries are digitised twice with no record that they are the same edge. Simple to produce, but it makes adjacency queries impossible without rebuilding the relationships.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.