computer science

Privacy-preserving computational geometry

Privacy-preserving computational geometry is a computer science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Privacy-preserving computational geometry rather than just read about it. In short: Privacy-preserving computational geometry is the research area on the intersection of the domains of secure multi-party computation (SMC) and computational geometry. Classical problems of computational geometry reconsidered from the point of view of SMC include shape intersection, private point inclusion problem, range searching, convex hull, and more.

Key takeaways

Privacy-preserving computational geometry belongs to computer science; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Privacy-preserving computational geometry to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Privacy-preserving computational geometry from memory before moving on to harder problems.

Reference excerpt

Privacy-preserving computational geometry is the research area on the intersection of the domains of secure multi-party computation (SMC) and computational geometry. Classical problems of computational geometry reconsidered from the point of view of SMC include shape intersection, private point inclusion problem, range searching, convex hull, and more. A pioneering work in this area was a 2001 paper by Atallah and Du, in which the secure point in polygon inclusion and polygonal intersection problems were considered. Other problems are computation of the distance between two private points and secure two-party point-circle inclusion problem.

Problem statements The problems use the conventional "Alice and Bob" terminology. In all problems the required solution is a protocol of information exchange during which no additional information is revealed beyond what may be inferred from the answer to the required question.

Point-in-polygon: Alice has a point a, and Bob has a polygon B. They need to determine whether a is inside B. Polygon pair intersection: Alice has a polygon A, and Bob has a polygon B. They need to determine whether A intersects B.

References

Worked examples

Example 1 — a first encounter with Privacy-preserving computational geometry

Start with the simplest possible case. Write down what Privacy-preserving computational geometry claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In computer science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Privacy-preserving computational geometry before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Privacy-preserving computational geometry ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Privacy-preserving computational geometry

In research: Privacy-preserving computational geometry appears in computer science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Privacy-preserving computational geometry in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Privacy-preserving computational geometry is common in secondary-school and first-year university syllabi. It links to neighbouring topics Computational fields of study, Computational geometry, Theory of cryptography, so understanding it makes those chapters shorter.
In everyday life: Look for Privacy-preserving computational geometry outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Privacy-preserving computational geometry in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Privacy-preserving computational geometry means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Privacy-preserving computational geometry out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Privacy-preserving computational geometry in simple terms?

Why does Privacy-preserving computational geometry matter?

Because it connects several computer science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Privacy-preserving computational geometry?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Privacy-preserving computational geometry.