COMP30110 SPRING TRIMESTER ASSESSMENT (2023)
Hello, dear friend, you can consult us at any time if you have any questions, add WeChat: daixieit
COMP30110 SPRING TRIMESTER ASSESSMENT (2023)
Answer any 3 questions from Part A and the 1 compulsory question in Part B. Each answer should be approximately 500 words but no longer than 600 words. All questions carry equal weight. Only 4 answers per student will be graded.
PART A: Answer any 3 out of the following 5 questions:
1. Discuss topological data structures for plane subdivisions. Discuss the DCEL data structure and the symmetric data structure and highlight their advantages and disadvantages in terms of spatial queries they efficiently support/do not support.
2. Compare and contrast vector and raster spatial data in terms of data models, storage and manipulation strategies, and possible applications. NOTE : This question covers many aspects of the module. Therefore, one of the skills you are asked to show is the ability to summarise the topic into a concise but complete answer (i.e. it contains all relevant information).
3. Discuss the plane sweep technique used in several computational geometry algorithms. Research and discuss one computational geometry algorithm that was not covered in the module and explain how such an algorithm can be applied to solve a spatial problem (e.g. how it could be used to answer one of the spatial queries discussed in the module).
4. Introduce triangulations as particular cases of plane subdivisions. Discuss the applications of triangulations in the context of spatial information systems as covered in the module. Research and discuss an algorithm for calculating a triangulation of a set of points in 2D that was not covered in the module.
5. Discuss the integrated approach for spatial data management used in Spatial Database Management Systems. Explain how such an approach is implemented in Oracle Spatial.
PART B: Answer the following question:
6. Discuss spatial indexing for vector data. Provide an example of a vector dataset (a figure) and explain how a point query would be processed using one of the indexing approaches we studied. Explain how in your example the query is supported by the use of the index. The example should be your own – i.e. different from all examples provided in the module and not plagiarised from any other source (plagiarism detection software will be applied).
NOTE: Your set of answers should demonstrate:
your familiarity and knowledge of the topics involved;
the ability to organise, analyse and present arguments fluently and to support them with
evidence and examples;
the ability to summarise a topic into a concise but complete answer (i.e. it contains all relevant
information);
the ability to critically analyse issues;
any additional reading you have done (please include references where appropriate).
Please upload a document in .pdf format.
Submission deadline: 11:59pm on Friday April 28th, 2023.
2023-04-13