Computing boundary cycle of a pseudo-triangle polygon from its visibility graph
From MaRDI portal
Publication:1997264
DOI10.1007/978-3-030-57852-7_5OpenAlexW3082636863MaRDI QIDQ1997264
Hossein Boomari, Soheila Farokhi
Publication date: 1 March 2021
Full work available at URL: https://arxiv.org/abs/2002.06712
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Theory of computing (68Qxx)
Cites Work
- Unnamed Item
- Round-Efficient Black-Box Construction of Composable Multi-Party Computation
- Black-Box Constructions of Composable Protocols without Set-Up
- On Adaptively Secure Protocols
- Black-box constructions for secure computation
- Lossy Trapdoor Functions and Their Applications
- Round-Optimal Black-Box Two-Party Computation
- Bounded-concurrent secure multi-party computation with a dishonest majority
- New notions of security
- Bounded-concurrent secure two-party computation without setup assumptions
- Founding Cryptography on Oblivious Transfer – Efficiently
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- A Unified Framework for UC from Only OT
- A unified framework for concurrent security
- Non-malleability amplification
- Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way
- Advances in Cryptology – CRYPTO 2004
- Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol
- Theory of Cryptography
- Theory of Cryptography
This page was built for publication: Computing boundary cycle of a pseudo-triangle polygon from its visibility graph
